Semantical considerations on nonmonotonic logic
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
An A-Prolog Decision Support System for the Space Shuttle
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Answer set based design of knowledge systems
Annals of Mathematics and Artificial Intelligence
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Theory and Practice of Logic Programming
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Quantified Equilibrium Logic and Foundations for Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Metabolic Network Expansion with Answer Set Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Logic Programming for Multiagent Planning with Negotiation
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On Reductive Semantics of Aggregates in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
ANTON: Composing Logic and Logic Composing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A reductive semantics for counting and choice in answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Hyperequivalence of logic programs with respect to supported models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Answer set planning under action costs
Journal of Artificial Intelligence Research
Combining nonmonotonic knowledge bases with external sources
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Character-Based cladistics and answer set programming
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Revisiting epistemic specifications
Logic programming, knowledge representation, and nonmonotonic reasoning
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Unfounded sets and well-founded semantics of answer set programs with aggregates
Journal of Artificial Intelligence Research
First-order extension of the FLP stable model semantics via modified circumscription
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
ACM Transactions on Computational Logic (TOCL)
Well-Supported semantics for logic programs with generalized rules
Correct Reasoning
A rational extension of stable model semantics to the full propositional language
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (constraints), the stable-model semantics, in its broadly accepted generalization stemming from the work by Pearce, Ferraris and Lifschitz, has a competitor: the semantics proposed by Faber, Leone and Pfeifer, which seems to be essentially different. Our goal is to explain the relationship between the two semantics. Pearce, Ferraris and Lifschitz's extension of the stable-model semantics is best viewed in the setting of arbitrary propositional theories. We propose here an extension of the Faber-Leone-Pfeifer semantics, or FLP semantics, for short, to the full propositional language, which reveals both common threads and differences between the FLP and stable-model semantics. We use our characterizations of FLP-stable models to derive corresponding results on strong equivalence and on normal forms of theories under the FLP semantics. We apply a similar approach to define supported models for arbitrary propositional theories, and to study their properties.