Tools for modeling and solving search problems

Authors:
Deborah East;Mikhail Iakhiaev;Artur Mikitiuk;Mirosław Truszczyński
Affiliations:
Department of Computer Science, Texas State University - San Marcos, San Marcos, TX 78666, USA;Department of Computer Science, University of Texas at Austin, Austin, TX 78712-0233, USA;Department of Computer Science, University of Texas at Tyler, Tyler, TX 75799, USA;Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046, USA
Venue:
AI Communications
Year:
2006

Citing 5
Cited 2

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
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
Predicate-calculus-based logics for modeling and solving search problems

ACM Transactions on Computational Logic (TOCL)
Generalizing Boolean satisfiability I: background and survey of existing work

Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems

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

Business Driven SOA Customization

ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Grounding FO and FO(ID) with bounds

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a language PSpb to model search problems that are specified in terms of boolean combinations of pseudo-boolean constraints. We then describe software tools that allow one to use SAT and SAT(PB) solvers to compute solutions to instances of search problems represented in the language PSpb.