Gelfond, M., and Lifschitz, V. 1988. The stable semantics for logic programs. In Proceedings of the 5th International Conference on Logic Programming, 1070--1080. MIT Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Computing Minimal Models, Stable Models and Answer Sets - Lonc, Truszczynski (Correct)
.... of algorithms to compute models of propositional CNF theories [Kul99] and improves on our earlier study of algorithms to compute stable models [LT03] Propositional logic with the minimal model semantics (propositional circumscription) McC80,Lif88] logic programming with stable model semantics [GL88] and disjunctive logic programming with the answer set semantics [GL91] are among most commonly studied and broadly used knowledge representation formalisms (we refer the reader to [MT93,BDK97] for a detailed treatment of these logics and additional pointers to literature) Recently, they have ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070--1080. MIT Press, 1988.
Logic Programming for Evolving Agents - Alferes, Brogi, Leite, Pereira (2003) (Correct)
....of programs are then treated as in DLP, where the most recent rules are set in force, and previous rules are valid (by inertia) insofar as possible, i.e. they are kept for as long as they do not conflict with more recent ones. In DLP, default negation is treated as in stable models of normal [7] and generalized programs [10] Formally, a dynamic logic program is a sequence P 1 # # P n (also denoted P, where is a set of generalized logic programs indexed by 1, n) and its semantic is determined by let S, and let M be a set of propositional atoms of L. ....
....in the following sense: Proposition 2. Let P be a generalized logic program (without predicate assert 1) over a language and be any sequence with n 0 of empty EVOLP programs. Then, M is a stable model of P given i# the restriction of M to is a stable model of P (in the sense of [7, 10]) The possibility of having various stable models after an event sequence is of special interest for using EVOLP as a language for reasoning about possible evolutions of an agent s knowledge base. However, as we shall better discuss later, to implement agents that execute actions it might be ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In ICLP'88. MIT Press, 1988.
Constraint Lingo: Towards high-level constraint programming - Finkel, Marek, Truszczynski (2002) (Correct)
....been used with great success. Solvers such [4] can be used to represent and solve such problems. Second, recent research has modeled constraint satisfaction problems as DATALOG : programs for which stable models represent solutions [5, 6] Programs such as smodels [7] compute stable models [8] of such programs. Third, constraint satisfaction problems can be modeled as disjunctive logic programs; dlv [9] can compute answer sets of those programs. Fourth, the logic of propositional schemata forms an answer set programming formalism that can be used for solving constraintsatisfaction ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
Evolving Logic Programs - Alferes, Brogi, Leite, Pereira (2002) (2 citations) (Correct)
....as in Dynamic Logic Programs (DLP) 1] where the most recent rules are put in force, and the previous rules are valid (by inertia) as far as possible, i.e. they are kept for as long as they do not conflict with more recent ones. In DLP, default negation is treated as in stable models of normal [8] and generalized programs [12] Formally, a dynamic logic program is a sequence P 1 . P n (also denoted P, where is a set of generalized logic programs indexed by 1, n) and its semantic is determined by : L, let s S, and let M be a set of propositional atoms ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, ICLP'88, pages 1070--1080. MIT Press, 1988.
Propositional Satisfiability in Answer-Set Programming - East, Truszczynski (2001) (3 citations) (Correct)
....approach is now often referred to as answer set programming (or ASP) We commonly restrict the language by disallowing function symbols to guarantee finiteness of models of finite theories. In the present paper, we also adopt this assumption. Logic programming with stable model semantics [GL88] (stable logic programming or SLP, in short) is an example of an ASP formalism [MT99] In SLP, we represent problem constraints by a fixed program (independent of problem instances) We represent a specific instance of the problem (input data) by a collection of ground atoms. To solve the ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070--1080. MIT Press, 1988.
MINERVA - Combining Societal Agents Knowledge - Leite, Alferes, Pereira (2001) (Correct)
....not A in a program or model into new atoms, say not A. The class of generalized logic programs can be viewed as a special case of yet broader classes of programs, introduced earlier in [14] and, for the special case of normal programs, their semantics coincides with the stable models semantics [8]. Dynamic Logic Programming Next we recall the semantics of dynamic logic programming [2] A dynamic logic program is a sequence 7o . also denoted by ( 7) where 7 ) Ps: s is a nite or innite sequence of LPs, indexed by the nite or innite set S 1, 2, r, Such sequence may ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Procs. oflCLP-88. MIT Press, 1988.
On the Use of Multi-dimensional Dynamic Logic Programming .. - Leite, Alferes, Pereira (2001) (Correct)
....not A in a program or model into new atoms, say not A. The class of generalized logic programs can be viewed as a special case of yet broader classes of programs, introduced earlier in [13] and, for the special case of normal programs, their semantics coincides with the stable models semantics [7]. In [2] the reader can find the motivation for the usage of generalized logic programs, instead of using simple denials as a result of freely moving the head not s into the body. 2.2 Dynamic Logic Programming Next we recall the semantics of dynamic logic programming [1] A dynamic logic ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Procs. of ICLP-88. MIT Press, 1988.
Fixed-Parameter Complexity of Semantics for Logic Programs - Lonc, Truszczynski (Correct)
....atoms from the bodies of all the rules that remain (that is, those rules that are not blocked by M ) The reduct P is a Horn program. Thus, it has a least model. We say that M is a stable model of P if M = lm(P ) Both the notion of the reduct and that of a stable model were introduced in [GL88]. It is known that every stable model of a program P is a supported model of P . The converse does not hold in general. However, if a program P is purely negative, then stable and supported models of P coincide [Fag94] In our arguments we use fixed parameter complexity results on problems to ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070--1080. MIT Press, 1988.
Ultimate Approximations in Nonmonotonic Knowledge.. - Denecker, Marek.. (2002) (2 citations) (Correct)
.... the concept of a bilattice and relying on some general properties of operators on lattices and bilattices, Fitting proposed an elegant algebraic treatment of all major 2 , 3 and 4 valued semantics of logic programs [Fit01] that is, the supported model semantics [Cla78] stable model semantics [GL88], KripkeKleene semantics [Fit85, Kun87] and well founded semantics [VRS91] In [DMT00a] we extended Fitting s work to a more abstract setting of the study of fixpoints of lattice operators. Central to our approach is the concept of an approximation of a lattice operator O. An approximation is an ....
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070--1080. MIT Press, 1988.
Approximations, Stable Operators, Well-Founded.. - Denecker, Marek.. (2000) (Correct)
....T P yield the partial supported model semantics and Kripke Kleene semantics for logic programs. The other operator is a 4 valued stable operator 0 P introduced in (Przymusinski, 1990) The operator 0 P can be regarded as a multi valued generalization of the Gelfond Lifschitz operator GL P (Gelfond and Lifschitz, 1988). Fixpoints of the operator 0 P determine the partial stable model semantics and the well founded semantics. In (Denecker et al. 1998; Denecker et al. 2000) we observed that an operator based approach to logic programming put forth by Fitting can be adapted to the case of two other ....
....of logic programming, xpoints of the van Emden Kowalski operator T P determine (2 valued) supported models of a program P . Supported model semantics (also known as Clark completion semantics) is often too weak for knowledge representation applications. The class of stable models was proposed in (Gelfond and Lifschitz, 1988) as the basis of an alternative semantics for programs with negation. It is well known that stable models form a subclass of the class of supported models. Our goal in this section is to study abstract principles relating supported and stable models. More generally, we search for principles that ....
Gelfond, M. and Lifschitz, V. (1988). The stable semantics for logic programs. In R. Kowalski, and K. Bowen, editors, Proceedings of the 5th International Symposium on Logic Programming, pages 1070-1080, Cambridge, MA. MIT Press.
Strong Equivalence of Nonmonotonic Theories - an Algebraic.. - Truszczynski (Correct)
No context found.
Gelfond, M., and Lifschitz, V. 1988. The stable semantics for logic programs. In Proceedings of the 5th International Conference on Logic Programming, 1070--1080. MIT Press.
Logic Programs With Monotone Cardinality Atoms - Marek, Niemelä, Truszczynski (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
An Evolvable Rule-Based E-mail Agent - Alferes, Brogi, Leite, Pereira (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In ICLP'88. MIT Press, 1988.
Using Criticalities as a Heuristic for Answer Set - Programming Orkunt Sabuncu (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070--1080. The MIT Press, 1988.
An Evolvable Rule-Based E-mail Agent - Alferes, Brogi, Leite, Pereira (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In ICLP'88. MIT Press, 1988.
Ultimate Approximation and Its Application in.. - Denecker, Marek.. (2004) (1 citation) (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
Constraint Lingo: Towards high-level constraint programming - Finkel, Marek, Truszczynski (2004) (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
An Evolving Agent with EVOLP - Alferes Brogi Leite (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In ICLP'88. MIT Press, 1988.
Ultimate Approximation and Its Application in Nonmonotonic.. - Denecker, al. (2004) (1 citation) (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070--1080. MIT Press, 1988.
Combining Societal Agents' Knowledge - Leite, Alferes, Pereira (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th international symposium on logic programming, pages 1070--1080, Cambridge, MA., 1988. MIT Press.
Using Logic Programs to Reason About Infinite Sets - Cenzer Marek Remmel (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, ICLP88, pages 1070--1080, 1988.
Common Derivations in Locally Determined - Logic Programs Douglas (Correct)
No context found.
M. Gelfond and V. Lifschitz, The stable semantics for logic programs, in: Proc. 5th Int'l. Symp. Logic Programming, MIT Press (1998), pp. 10701080.
An Evolving Agent with EVOLP - Alferes, Brogi, Leite, Pereira (2003) (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In ICLP'88. MIT Press, 1988.
A Language for Updates with Multiple Dimensions - Leite, Alferes, Pereira.. (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Procs. of ICLP-88. MIT Press, 1988.
A Language for Multi-dimensional Updates - Leite, Alferes, Pereira.. (Correct)
No context found.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Procs. of ICLP-88. MIT Press, 1988.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC