| Publication | Date of Publication | Type |
|---|
On compact representations of propositional circumscription
STACS 95 | 2017-12-04 | Paper |
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
On the separability of subproblems in Benders decompositions
Annals of Operations Research | 2010-02-01 | Paper |
Exploiting functional dependencies in declarative problem specifications
Artificial Intelligence | 2009-07-09 | Paper |
Evaluating ASP and commercial solvers on the CSPLib
Constraints | 2009-05-29 | Paper |
A unifying framework for structural properties of CSPS: definitions, complexity, tractability
| 2009-04-28 | Paper |
Compiling problem specifications into SAT
Artificial Intelligence | 2007-10-23 | Paper |
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence | 2007-10-23 | Paper |
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Combining relational algebra, SQL, constraint modelling, and local search
Theory and Practice of Logic Programming | 2007-03-23 | Paper |
Logics in Artificial Intelligence
Lecture Notes in Computer Science | 2006-10-25 | Paper |
AI*IA 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
scientific article; zbMATH DE number 2086597 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2084733 (Why is no real title available?)
| 2004-08-09 | Paper |
Tractable reasoning via approximation
Artificial Intelligence | 2003-02-04 | Paper |
Preprocessing of intractable problems
Information and Computation | 2003-01-14 | Paper |
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
Journal of Automated Reasoning | 2002-08-20 | Paper |
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
| 2002-02-27 | Paper |
scientific article; zbMATH DE number 1692953 (Why is no real title available?)
| 2002-01-21 | Paper |
NP-SPEC: An executable specification language for solving all problems in NP
Computer Languages | 2001-11-08 | Paper |
scientific article; zbMATH DE number 1509480 (Why is no real title available?)
| 2000-09-19 | Paper |
Semantical and computational aspects of Horn approximations
Artificial Intelligence | 2000-08-21 | Paper |
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence | 2000-06-07 | Paper |
The size of a revised knowledge base
Artificial Intelligence | 2000-06-04 | Paper |
Circumscribing DATALOG: expressive power and complexity
Theoretical Computer Science | 1998-08-13 | Paper |
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence | 1998-07-23 | Paper |
On compact representations of propositional circumscription
Theoretical Computer Science | 1998-07-22 | Paper |
On the complexity of entailment in propositional multivalued logics
Annals of Mathematics and Artificial Intelligence | 1998-04-22 | Paper |
Using abstract resources to control reasoning
Journal of Logic, Language and Information | 1998-01-01 | Paper |
Tractable reasoning in artificial intelligence
Lecture Notes in Computer Science | 1995-08-07 | Paper |
scientific article; zbMATH DE number 762062 (Why is no real title available?)
| 1995-06-08 | Paper |
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences | 1995-02-13 | Paper |
scientific article; zbMATH DE number 611096 (Why is no real title available?)
| 1994-08-29 | Paper |
A survey of complexity results for non-monotonic logics
The Journal of Logic Programming | 1994-01-13 | Paper |
The complexity of model checking for circumscriptive formulae
Information Processing Letters | 1993-04-01 | Paper |
An efficient method for eliminating varying predicates from a circumscription
Artificial Intelligence | 1992-09-27 | Paper |
