Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
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)
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
Circumscribing DATALOG: expressive power and complexity
Theoretical Computer Science
The OPL optimization programming language
The OPL optimization programming language
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Principles of Logic and Logic Programming
Principles of Logic and Logic Programming
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Towards Local Search for Answer Sets
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Combining Relational Algebra, SQL, and Constraint Programming
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
DATALOG with Constraints - An Answer-Set Programming System
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Propositional Satisfiability in Answer-Set Programming
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Existential second-order logic over graphs: charting the tractability frontier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Lifted search engines for satisfiability
Lifted search engines for satisfiability
Theory and Practice of Logic Programming
On the expressibility of stable logic programming
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Solving linear pseudo-Boolean constraint problems with local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
Tools for modeling and solving search problems
AI Communications
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
Expressive power and abstraction in Essence
Constraints
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Experiences with text mining large collections of unstructured systems development artifacts at jpl
Proceedings of the 33rd International Conference on Software Engineering
Application of answer set programming for public health data integration and analysis
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
Implementation and experimentation of the logic language NP Datalog
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
The answer-set programming (ASP) paradigm is a way of using logic to solve search problems. Given a search problem, to solve it one designs a logic theory so that models of this theory represent problem solutions. To compute a solution to the problem, one computes a model of the theory. Several answer-set programming formalisms have been developed on the basis of logic programming with the semantics of answer sets. In this article we show that predicate logic also gives rise to effective implementations of the ASP paradigm, similar in spirit to logic programming with the answer-set semantics and with a similar scope of applicability. Specifically, we propose two logics based on predicate calculus as formalisms for encoding search problems. We show that the expressive power of these logics is given by the class NPMV. We demonstrate their use in programming and discuss computational approaches to model finding. To address this latter issue, we follow a two-pronged approach. On the one hand, we show that the problem can be reduced to that of computing models of propositional theories and, more generally, of collections of pseudo-Boolean constraints. Consequently, programs (solvers) developed in the areas of propositional and pseudo-Boolean satisfiability can be used to compute models of theories in our logics. On the other hand, we develop native solvers designed specifically to exploit features of our formalisms. We present experimental results demonstrating the computational effectiveness of the overall approach.