| Publication | Date of Publication | Type |
|---|
Common equivalence and size of forgetting from Horn formulae
Annals of Mathematics and Artificial Intelligence | 2025-01-10 | Paper |
The ghosts of forgotten things: a study on size after forgetting
Annals of Pure and Applied Logic | 2024-06-24 | Paper |
Reconstructing a single-head formula to facilitate logical forgetting
Journal Of Logic And Computation | 2024-02-08 | Paper |
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
Belief integration and source reliability assessment
Journal of Artificial Intelligence Research | 2018-11-01 | Paper |
Compilability of propositional abduction
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Belief merging by examples
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Where fail-safe default logics fail
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking
IEEE Transactions on Computers | 2017-05-16 | Paper |
On the complexity of second-best abductive explanations
International Journal of Approximate Reasoning | 2015-12-21 | Paper |
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM | 2015-10-30 | Paper |
Revision by history
Journal of Artificial Intelligence Research | 2015-03-04 | Paper |
Bijective faithful translations among default logics
Journal Of Logic And Computation | 2015-01-12 | Paper |
On the complexity of extension checking in default logic
Information Processing Letters | 2010-01-18 | Paper |
Seminormalizing a default theory
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
Redundancy in logic. II: 2CNF and Horn propositional formulae
Artificial Intelligence | 2009-07-17 | Paper |
Redundancy in logic. III: Non-monotonic reasoning
Artificial Intelligence | 2009-07-17 | Paper |
Redundancy in logic. I: CNF propositional formulae
Artificial Intelligence | 2007-10-23 | Paper |
Consistency defaults
Studia Logica | 2007-10-16 | Paper |
AI*IA 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-06-27 | Paper |
scientific article; zbMATH DE number 2243354 (Why is no real title available?)
| 2006-01-04 | Paper |
On the complexity of case-based planning
Journal of Experimental & Theoretical Artificial Intelligence | 2005-11-15 | Paper |
Complexity and compilability of diagnosis and recovery of graph-based systems
International Journal of Intelligent Systems | 2005-11-07 | Paper |
Representability in Default Logic
Logic Journal of the IGPL | 2005-10-18 | Paper |
Uncontroversial Default Logic
Journal Of Logic And Computation | 2005-03-21 | Paper |
scientific article; zbMATH DE number 2140435 (Why is no real title available?)
| 2005-03-03 | Paper |
Reducing belief revision to circumscription (and vice versa)
Artificial Intelligence | 2003-08-28 | Paper |
scientific article; zbMATH DE number 1946872 (Why is no real title available?)
| 2003-07-07 | Paper |
scientific article; zbMATH DE number 1876863 (Why is no real title available?)
| 2003-06-02 | Paper |
Conditional independence in propositional logic.
Artificial Intelligence | 2003-01-21 | Paper |
Preprocessing of intractable problems
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1759389 (Why is no real title available?)
| 2002-11-25 | Paper |
Belief revision and update: Complexity of model checking
Journal of Computer and System Sciences | 2001-09-09 | Paper |
scientific article; zbMATH DE number 1509480 (Why is no real title available?)
| 2000-09-19 | Paper |
The complexity of belief update
Artificial Intelligence | 2000-08-21 | Paper |
The size of a revised knowledge base
Artificial Intelligence | 2000-06-04 | Paper |
On the complexity of choosing the branching literal in DPLL
Artificial Intelligence | 2000-06-04 | Paper |
