Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

AUSAI
2006
Springer

favoriteEmaildiscussreport

112views Artificial Intelligence» more AUSAI 2006»

Heyting Domains for Constraint Abduction

14 years 2 months ago

Heyting Domains for Constraint Abduction

Download www.cse.unsw.edu.au

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.

Michael J. Maher

Real-time Traffic

Abduction Problems | Artificial Intelligence | AUSAI 2006 | Constraint Domains |

claim paper

Related Content

» Interpreting Abduction in CLP

» Frame consistency computing with causal explanations

» DARE a system for distributed abductive reasoning

» A New Framework for Knowledge Revision of Abductive Agents Through Their Interaction

» Integrating answer set programming and constraint logic programming

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	AUSAI
Authors	Michael J. Maher

Comments (0)