Compiling problem specification into SAT

Authors:
Marco Cadoli;Andrea Schaerf
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Via Salaria 113, I-00198 Roma, Italy;Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Via delle Scienze 208, I-33100 Udine, Italy
Venue:
Artificial Intelligence - Special volume on reformulation
Year:
2005

Citing 22
Cited 4

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental results on the application of satisfiability algorithms to scheduling problems

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Generating hard satisfiability problems

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Circumscribing DATALOG: expressive power and complexity

Theoretical Computer Science
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Automating first-order relational logic

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
A machine program for theorem-proving

Communications of the ACM
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
Scheduling Sport Tournaments using Constraint Logic Programming

Constraints
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation

Journal of Automated Reasoning
Dual Models of Permutation Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Solving Hard Combinatorial Problems with GSAT - A Case Study

KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
NP-SPEC: an executable specification language for solving all problems in NP

Computer Languages

Automated reformulation of specifications by safe delay of constraints

Artificial Intelligence
Exploiting functional dependencies in declarative problem specifications

Artificial Intelligence
USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS

Applied Artificial Intelligence
Evaluating ASP and Commercial Solvers on the CSPLib

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such as to capture all problems which belong to the complexity class NP. The target SAT instance is solved using any of the various state-of-the-art solvers available from the community. The system obtained is an executable specification language for all NP problems which shows interesting computational properties. The performance of the system has been tested on a few classical problems, namely graph coloring, Hamiltonian cycle, job-shop scheduling, and on a real-world scheduling application, namely the tournament scheduling problem.