Solving Advanced Reasoning Tasks using Quantified Boolean Formulas (2000)

Cached

Download Links

by Uwe Egly , Thomas Eiter , Hans Tompits , Stefan Woltran
Citations:68 - 20 self

Active Bibliography

QUIP—A Tool for Computing Nonmonotonic Reasoning Tasks ∗ – Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran, Technische Universität Wien - 2000
9 Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks – Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran - 2002
4 Expressing Default Abduction Problems as Quantified Boolean Formulas – Hans Tompits - 2002
5 Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results – Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran - 2001
BEGINNING TO END. AMONG THINGS THAT REMAIN TO BE DONE ARE: HAVING A PROPER NAMING CONVENTION FOR THE PROGRAMS IN THE EXAMPLES, – Chitta Baral - 2001
330 Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm – Ilkka Niemelä
87 Logic Programming and Knowledge Representation - the A-Prolog perspective – Michael Gelfond, Nicola Leone - 2002
39 Computing With Default Logic – Pawel Cholewinski, Victor W. Marek, Artur Mikitiuk, Miros/law Truszczynski - 1999
63 Representing Knowledge in A-Prolog – Michael Gelfond
312 Extending and Implementing the Stable Model Semantics – Patrik Simons, Ilkka Niemelä, Timo Soininen - 2002
27 Towards Constraint Satisfaction through Logic Programs and the Stable Model Semantics – Patrik Simons - 1997
224 Logic Programming and Knowledge Representation – Chitta Baral, Michael Gelfond - 1994
Hybrid reasoning with . . . – Sana Fraz - 2009
21 Semantics and complexity of abduction from default theories – Thomas Eiter, Georg Gottlob, Nicola Leone T - 1997
71 Stationary Semantics for Normal and Disjunctive Logic Programs – Teodor Przymusinski - 1991
24 Stationary Default Extensions – Halina Przymusinska, Teodor Prymusinski - 1992
250 Stable models and an alternative logic programming paradigm – Victor W. Marek - 1999
7 On computing belief change operations using quantified boolean formulas – James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran - 2004
3 On the Complexity of Theory Curbing – Thomas Eiter, Georg Gottlob - 2000