In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
It is well known that modifying software by hand, especially someone else's, is not only slow and tedious but so notoriously error-prone that we strive for components that ne...
We introduce A-ranked preferential structures and combine them with an accessibility relation. A-ranked preferential structures are intermediate between simple preferential struct...
Background: A simple classification rule with few genes and parameters is desirable when applying a classification rule to new data. One popular simple classification rule, diagon...