Foundations of logic programming
Foundations of logic programming
Handbook of theoretical computer science (vol. B)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
aspps - An Implementation of Answer-Set Programming with Propositional Schemata
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Experimenting with parallelism for the instantiation of ASP programs
Journal of Algorithms
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional schemata and on a version of the Closed World Assumption. We call it the extended logic of propositional schemata with CWA (PS+, in symbols). An important feature of the logic PS+ is that it supports explicit modeling of constraints on cardinalities of sets. In the paper, we characterize the class of problems that can be solved by finite PS+ theories. We implement a programming system based on the logic PS+ and design and implement a solver for processing theories in PS+. We present encouraging performance results for our approach -- we show it to be competitive with smodels, a state-of-the-art answer-set programming system based on stable logic programming.