On domain independent databases
Foundations of deductive databases and logic programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Twelve Definitions of a Stable Model
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
Safe Formulas in the General Theory of Stable Models (Preliminary Report)
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Revised Concept of Safety for General Answer Set Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On Reductive Semantics of Aggregates in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A Default Approach to Semantics of Logic Programs with Constraint Atoms
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
System f2lp --- Computing Answer Sets of First-Order Formulas
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Symmetric splitting in the general theory of stable models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Circumscriptive event calculus as answer set programming
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Stable models and circumscription
Artificial Intelligence
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Thirteen definitions of a stable model
Fields of logic and computation
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Module theorem for the general theory of stable models
Theory and Practice of Logic Programming
Hi-index | 0.01 |
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the meaning of counting and choice by reducing these constructs to first-order formulas. For the new language, the concept of a safe program is defined, and its semantic role is investigated. We compare the new language with the concept of a disjunctive program with aggregates introduced by Faber, Leone and Pfeifer, and discuss the possibility of implementing a fragment of the language by translating it into the input language of the answer set solver DLV. The language is also compared with cardinality constraint programs defined by Syrjänen.