Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: East, Deborah | Iakhiaev, Mikhail | Mikitiuk, Artur | Truszczyński, Mirosław
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
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.
Keywords: SAT, pseudo-boolean constraints, grounder
Journal: AI Communications, vol. 19, no. 4, pp. 301-312, 2006
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]