Heyting domains for constraint abduction

Authors:
Michael Maher
Affiliations:
National ICT Australia and University of NSW, Sydney, Australia
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 6
Cited 1

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Rewriting Unions of General Conjunctive Queries Using Views

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
The Algebraic Structure of Sets of Regions

COSIT '97 Proceedings of the International Conference on Spatial Information Theory: A Theoretical Basis for GIS
Herbrand Constraint Abduction

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Query-answering algorithms for information agents

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Abduction of linear arithmetic constraints

ICLP'05 Proceedings of the 21st international conference on Logic Programming

On Computing Constraint Abduction Answers

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate constraint domains in which answers to constraint abduction problems can be represented compactly by a most general answer. We demonstrate several classes of domains which have this property, but show that the property is not compositional.