On Computing Constraint Abduction Answers

Authors:
Michael Maher;Ge Huang
Affiliations:
NICTA and University of NSW, Sydney, Australia;NICTA and University of NSW, Sydney, Australia
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 12
Cited 3

Unification revisited

Foundations of deductive databases and logic programming
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Guarded recursive datatype constructors

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Herbrand Constraint Abduction

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Stratified type inference for generalized algebraic data types

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simple unification-based type inference for GADTs

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A constraint-based approach to guarded algebraic data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
The existential theory of equations with rational constraints in free groups is PSPACE-complete

Information and Computation
Type processing by constraint reasoning

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Heyting domains for constraint abduction

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

A formal framework for trust policy negotiation in autonomic systems: abduction with soft constraints

ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
Inferring definite counterexamples through under-approximation

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. This problem is of interest when performing type inference involving generalized algebraic data types. We show that simply recognizing a maximally general answer or fully maximal answer is co-NP complete. However we present an algorithm that computes the (finite) set of fully maximal answers of an abduction problem. The maximally general answers are generally infinite in number but we show how to generate a finite representation of them when only unary function symbols are present.