DocumentCode
2023372
Title
Herbrand constraint abduction
Author
Maher, Michael
Author_Institution
Nat. ICT, Sydney, NSW, Australia
fYear
2005
fDate
26-29 June 2005
Firstpage
397
Lastpage
406
Abstract
In this paper we explore abduction over the Herbrand domain - equations on the algebra of finite terms (or finite trees) - which is a central element of logic programming and first-order automated reasoning. This paper is a case study of constraint abduction in the Herbrand domain. The direct relationship between Herbrand constraint abduction and type inference outlined above should make it easy to interpret the results of this paper in the context of type inference.
Keywords
logic programming; process algebra; type theory; Herbrand domain; automated reasoning; logic programming; process algebra; type inference; Algebra; Australia; Concrete; Databases; Equations; Logic programming; Query processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on
ISSN
1043-6871
Print_ISBN
0-7695-2266-1
Type
conf
DOI
10.1109/LICS.2005.21
Filename
1509245
Link To Document