Results 11  20
of
786,708
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1050 (76 self)
 Add to MetaCart
An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract

Cited by 1831 (66 self)
 Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 444 (13 self)
 Add to MetaCart
, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical twovalued setting, but the result provides a natural semantics for distributed logic programs, including
Incompleteness of a Firstorder Gödel Logic and some Temporal Logics of Programs
"... Abstract. It is shown that the infinitevalued firstorder Gödel logic G 0 based on the set of truth values {1/k: k ∈ ω \ {0}} ∪ {0} is not r.e. The logic G 0 is the same as that obtained from the Kripke semantics for firstorder intuitionistic logic with constant domains and where the order struct ..."
Abstract
 Add to MetaCart
Abstract. It is shown that the infinitevalued firstorder Gödel logic G 0 based on the set of truth values {1/k: k ∈ ω \ {0}} ∪ {0} is not r.e. The logic G 0 is the same as that obtained from the Kripke semantics for firstorder intuitionistic logic with constant domains and where the order
Incompleteness of a Firstorder Gödel Logic and some Temporal Logics of Programs
, 1996
"... It is shown that the in nitevalued rstorder Godel logic based on the set of truth values f1=k : k 2 ! n f0gg [ f0g is not r.e. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
It is shown that the in nitevalued rstorder Godel logic based on the set of truth values f1=k : k 2 ! n f0gg [ f0g is not r.e.
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Representing Action and Change by Logic Programs
 Journal of Logic Programming
, 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract

Cited by 425 (26 self)
 Add to MetaCart
We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract

Cited by 621 (72 self)
 Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike 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 425 (124 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 firstorder and higherorder Horn clauses with classical provability are examples of such a language
A Spatial Logic based on Regions and Connection
 PROCEEDINGS 3RD INTERNATIONAL CONFERENCE ON KNOWLEDGE REPRESENTATION AND REASONING
, 1992
"... We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its us ..."
Abstract

Cited by 736 (32 self)
 Add to MetaCart
We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its
Results 11  20
of
786,708