Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
477
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract
-
Cited by 366 (57 self)
- Add to MetaCart
results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem-prov ..."
Abstract
-
Cited by 514 (2 self)
- Add to MetaCart
-theoretic semantics of a language AgentSpeak(L). This language can be viewed as an abstraction of one of the implemented BDI systems (i.e., PRS) and allows agent programs to be written and interpreted in a manner similar to that of horn-clause logic programs. We show how to perform derivations in this logic using a
Uniform proofs as a foundation for logic programming
- ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract
-
Cited by 428 (122 self)
- Add to MetaCart
that respects the interpretation of the logical connectives as search instructions. The concept of a uniform proof is used to define the notion of an abstract logic programming language, and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language
Guarded Horn Clauses
, 1986
"... This thesis introduces the programming language Guarded Horn Clauses which is abbreviated to GHC. Guarded Horn Clauses was born from the examination of existing logic programming languages and logic programming in general, with special attention paid to parallelism. The main feature of ..."
Abstract
-
Cited by 122 (6 self)
- Add to MetaCart
This thesis introduces the programming language Guarded Horn Clauses which is abbreviated to GHC. Guarded Horn Clauses was born from the examination of existing logic programming languages and logic programming in general, with special attention paid to parallelism. The main feature of
Complexity and expressive power . . .
, 2001
"... This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality
Stable models and an alternative logic programming paradigm
- In The Logic Programming Paradigm: a 25-Year Perspective
, 1999
"... In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting ..."
Abstract
-
Cited by 310 (19 self)
- Add to MetaCart
alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with well-founded semantics. The proposed approach is based on the interpretation of program clauses as constraints. In this setting programs do not describe a single intended
Meta-Programming for Generalized Horn Clause Logic
, 1996
"... . In conventional logic programming systems, control information is expressed by clause and goal order and by purely procedural constructs, e.g., the Prolog cut. This approach destroys the equivalence of declarative and procedural semantics in logic programs. In this paper, we argue that in order to ..."
Abstract
-
Cited by 7 (6 self)
- Add to MetaCart
. In conventional logic programming systems, control information is expressed by clause and goal order and by purely procedural constructs, e.g., the Prolog cut. This approach destroys the equivalence of declarative and procedural semantics in logic programs. In this paper, we argue that in order
Higher-Order Horn Clauses
- JOURNAL OF THE ACM
, 1990
"... A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first-order ones by replacing first-order terms with simply typed #-terms and by permitting quantification ..."
Abstract
-
Cited by 62 (20 self)
- Add to MetaCart
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first-order ones by replacing first-order terms with simply typed #-terms and by permitting quantification
Generalized Horn Clause Programs
, 1994
"... This paper considers, in a general setting, an axiomatic basis for Horn clause logic programming. It characterizes a variety of "Horn-clause-like" computations, arising in contexts such as deductive databases, various abstract interpretations, and extensions to logic programming involvi ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
This paper considers, in a general setting, an axiomatic basis for Horn clause logic programming. It characterizes a variety of "Horn-clause-like" computations, arising in contexts such as deductive databases, various abstract interpretations, and extensions to logic programming
Results 1 - 10
of
477
