Enfragmo: a system for modelling and solving search problems with logic

Authors:
Amir Aavani;Xiongnan (Newman) Wu;Shahab Tasharrofi;Eugenia Ternovska;David Mitchell
Affiliations:
Simon Fraser University, Canada;Simon Fraser University, Canada;Simon Fraser University, Canada;Simon Fraser University, Canada;Simon Fraser University, Canada
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 9
Cited 1

System Description: DLV

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A framework for representing and solving NP search problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Declarative programming of search problems with built-in arithmetic

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
PBINT, a logic for modelling search problems involving arithmetic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Speed-up techniques for negation in grounding

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Potassco: The Potsdam Answer Set Solving Collection

AI Communications - Answer Set Programming
Grounding formulas with complex terms

Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Translating pseudo-boolean constraints into CNF

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing

Constraint Propagation for First-Order Logic and Inductive Definitions

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the Enfragmo system for specifying and solving combinatorial search problems. It supports natural specification of problems by providing users with a rich language, based on an extension of first order logic. Enfragmo takes as input a problem specification and a problem instance and produces a propositional CNF formula representing solutions to the instance, which is sent to a SAT solver. Because the specification language is high level, Enfragmo provides combinatorial problem solving capability to users without expertise in use of SAT solvers or algorithms for solving combinatorial problems. Here, we describe the specification language and implementation of Enfragmo, and give experimental evidence that its performance is comparable to that of related systems.