Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
The complexity of model checking for circumscriptive formulae
Information Processing Letters
Horn approximations of empirical data
Artificial Intelligence
Artificial Intelligence
On compact representations of propositional circumscription
Theoretical Computer Science
The Inverse Satisfiability Problem
SIAM Journal on Computing
Generating all maximal models of a Boolean expression
Information Processing Letters
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Inverse (or identification) problems involve deciding whether or not an explicitly given set of data points have an implicit description, for instance, in the form of a constraint network. Such problems provide insight into the relationships among various representations of knowledge, which may have differing computational properties. This paper formalizes and studies the inverse circumscription problem, which (roughly speaking) is to decide, given a set of models, if there exists a formula whose circumscription describes the input set.