Compiling Problem Specifications into SAT

Authors:
Marco Cadoli;Andrea Schaerf
Affiliations:
-;-
Venue:
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Year:
2001

Citing 18
Cited 3

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
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
Automatic generation of some results in finite algebra

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Combining Relational Algebra, SQL, and Constraint Programming

FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Transforming and refining abstract constraint specifications

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
NP-SPEC: an executable specification language for solving all problems in NP

Computer Languages

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 to capture exactly 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 performances of the system have been tested on a few classical problems, namely graph coloring, Hamiltonian cycle, and job-shop scheduling.