A framework for representing and solving NP search problems

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 430-435

  Mitchell, David G ^a   Ternovska, Eugenia ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFICATION PROBLEMS (CSP); NP SEARCH PROBLEMS; SOLVER DESIGN;

CONSTRAINT THEORY; DECISION THEORY; PROBLEM SOLVING;

ARTIFICIAL INTELLIGENCE;

EID: 27144449862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Cadoli, M., and Mancini, T. 2002. Combining Relational Algebra, SQL, and constraint programming. In Proc., FroCos-02, 147-161.
2. Denecker, M., and Ternovska, E. 2004a. Inductive situation calculus. In Proc., KR-04.
3. Denecker, M., and Ternovska, E. 2004b. A logic of non-monotone inductive definitions and its modularity properties. In Proc., LPNMR-04.
4. Denecker, M.; Bruynooghe, M.; and Marek, V. 2001. Logic programming revisited: Logic programs as inductive definitions. ACM Transactions on Computational Logic (TOCL) 4(2).
5. Denecker, M. 2000. Extending classical logic with inductive definitions. In Proc. CL'2000.
6. East, D., and Truszczynski, M. 2004. Predicate-calculus based logics for modeling and solving search problems. ACM TOCL. To appear.
7. Fagin, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Karp, R., ed., Complexity and Computation, SIAM-AMS Proc., 7, 43-73.
8. Fitting, M. 2003. Fixpoint semantics for logic programming - a survey. Theoretical Computer Science. To appear.
9. Flener, P.; Pearson, J.; and Agren, M. 2003. Introducing ESRA, a relational language for modelling combinatorial problems. In Proc., LOPSTR'03.
10. Graedel, E. 1992. Capturing complexity classes by fragments of second order logic. Theoretical Computer Science 101:35-57.
11. Hentenryck, P. V. 1999. The OPL Optimization Programming Language. MIT Press.
12. Jones, N., and Selman, A. 1974. Turing machines and the spectra of first-order formulas. Journal of Symbolic Logic 39:139-150.
13. Libkin, L. 2004. Elements of Finite Model Theory. Springer.
14. Marek, V. W., and Truszczynski, M. 1999. Stable logic programming - an alternative logic programming paradigm. Springer-Verlag. In: The Logic Programming Paradigm: A 25-Year Perspective, K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren, Eds.
15. Marien, M.; Gilis, D.; and Denecker, M. 2004. On the relation between ID-Logic and Answer Set Programming. In Proc., 9th European Conference on Logics in Artificial Intelligence, 108-120. Springer. LNCS Volume 3229.
16. Mitchell, D. 2005. A SAT solver primer. EATCS Bulletin 85:112-133. Columns: Logic in Computer Science.
17. Niemela, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4):241-273.
18. Pelov, N., and Ternovska, E. 2005. Reducing ID-Logic to propositional satisfiability. Submitted.
19. Van Gelder, A. 1993. An alternating fixpoint of logic programs with negation. Journal of computer and system sciences 47:185-221.