A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical definability of NP optimization problems
Information and Computation
NP optimization problems in Datalog
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
The OPL optimization programming language
The OPL optimization programming language
Logic programming in Oz with Mozart
Proceedings of the 1999 international conference on Logic programming
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
DATALOG Queries with Stratified Negation and Choice: from P to DP
ICDT '95 Proceedings of the 5th International Conference on Database Theory
ECLiPSe: Declarative Specification and Scaleable Implementation
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
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
Proceedings of the 2004 ACM symposium on Applied computing
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Constraint Lingo: towards high-level constraint programming
Software—Practice & Experience - Research Articles
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper presents a system prototype implementing ${\cal NP~ D}atalog$, a Datalog-like language for expressing $\cal NP$ search and optimization problems. ${\cal NP~ D}atalog$ extends DATALOG$^{\neg_s}$ (DATALOG with stratified negation) with intuitive and efficient constructs, i.e. constraints and a restricted form of (exclusive) disjunction used to define (nondeterministically) subsets (or partitions) of relations. The system translates ${\cal NP~ D}atalog$ queries into OPL programs, then solves them by using the ILOG Solver [16]. Thus, it combines an easy formulation of problems, expressed by means of a declarative logic language, and an efficient execution of the ILOG Solver. Several experiments show the effectiveness of this approach.