Results 1  10
of
849
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. The computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ
Smodels  an Implementation of the Stable Model and WellFounded Semantics for Normal Logic Programs
, 1997
"... The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range ..."
Abstract

Cited by 294 (9 self)
 Add to MetaCart
The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
 Artificial Intelligence
, 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a onetoone corresp ..."
Abstract

Cited by 260 (7 self)
 Add to MetaCart
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one
Propositional Semantics for Disjunctive Logic Programs
 Annals of Mathematics and Artificial Intelligence
, 1994
"... In this paper we study the properties of the class of headcyclefree extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory such th ..."
Abstract

Cited by 161 (2 self)
 Add to MetaCart
In this paper we study the properties of the class of headcyclefree extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory
Stable Semantics for Disjunctive Programs
 New Generation Computing
, 1991
"... We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., nondisjunctive) programs. Depending on whether only total (2valued) or all partial (3valued) models are used we obtain th ..."
Abstract

Cited by 169 (2 self)
 Add to MetaCart
We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., nondisjunctive) programs. Depending on whether only total (2valued) or all partial (3valued) models are used we obtain
On the Equivalence of Semantics for Normal Logic Programs
, 1995
"... this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by Sacc`a and Zaniolo, the preferential semantics by Dung, and a stronger version of the stable class s ..."
Abstract

Cited by 43 (18 self)
 Add to MetaCart
semantics by Baral and Subrahmanian. We show that these equivalent semantics can be characterized simply as selecting a particular kind of stable classes, called normal alternating fixpoints. In addition, we indicate that almost all proposed semantic frameworks coincide with that of normal alternating
Stationary Semantics for Normal and Disjunctive Logic Programs
 Annals of Mathematics and Artificial Intelligence
, 1991
"... this paper we show, however, that stationary expansions can be equivalently defined in terms of classical, 2valued logic. As a byproduct, we obtain a simpler and more natural description of stationary expansions. ..."
Abstract

Cited by 74 (15 self)
 Add to MetaCart
this paper we show, however, that stationary expansions can be equivalently defined in terms of classical, 2valued logic. As a byproduct, we obtain a simpler and more natural description of stationary expansions.
The wellfounded semantics in normal logic programs with uncertainty
 In Proc. of the 6th International Symposium on Functional and Logic Programming (FLOPS2002), number 2441 in Lecture Notes in Computer Science, 152–166. Aizu
"... Abstract. Many frameworks of logic programming have been proposed to manage uncertain information in deductive databases and expert systems. Roughly, on the basis of how uncertainty is associated to facts and the rules in a program, they can be classified into implicationbased (IB) and annotation ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Abstract. Many frameworks of logic programming have been proposed to manage uncertain information in deductive databases and expert systems. Roughly, on the basis of how uncertainty is associated to facts and the rules in a program, they can be classified into implicationbased (IB) and annotation
Topology and the Semantics of Logic Programs
 Fundamenta Informaticae
, 1995
"... We introduce topologies on spaces of interpretations which extend and generalise the query and positive query topologies of Batarekh and Subrahmanian. We study continuity in these topologies of the immediate consequence map associated with any normal logic program and provide necessary and sufficien ..."
Abstract

Cited by 51 (31 self)
 Add to MetaCart
We introduce topologies on spaces of interpretations which extend and generalise the query and positive query topologies of Batarekh and Subrahmanian. We study continuity in these topologies of the immediate consequence map associated with any normal logic program and provide necessary
Results 1  10
of
849