-
Chapter and Conference Paper
Modular Construction of Minimal Models
We show that minimal models of positive propositional theories can be decomposed based on the structure of the dependency graph of the theories. This observation can be useful for many applications involving c...
-
Chapter and Conference Paper
Algorithms for Computing X-Minimal Models
The problem of computing X-minimal models, that is, models minimal with respect to a subset X of all the atoms in a theory, is very relevant for computing circumscriptions and diagnosis. Unfortunately, the pro...
-
Chapter and Conference Paper
Meta-queries - Computation and Evaluation
Metaquery (also known as metapattern) is a datamining tool useful for learning rules involving more than one relation in the database. A metaquery is a template, or a second-order proposition in a language that d...
-
Article
Similarity preservation in default logic
The paper identifies a problem in default reasoning in Reiter’s Default Logic and related systems: elements which are similar given the axioms only, become distinguishable in extensions. We explain why, sometimes...