Abstract
Languages based on logical variables can regard finite domains, finite exclusions, and, generally, types as values. Like a variable can be bound to a non-ground structure which can be later specialized through in-place assignment of some inner variables, it can also be bound to, say, a domain structure which can be specialized later through ‘in-place deletion’ of some of its elements (e.g. by intersection with other domain structures). While finite domains prescribe the elements of a disjunctive structure, the complementary finite exclusions forbid the elements of a conjunctive structure. Domains and exclusions can be values of variables or occur inside clauses as/in terms or within an occurrence-binding construct (useful to name arbitrary terms). In a relational-functional language (e.g., RELFUN) they can also be returned as values of functions. Altogether, domains and exclusions become first-class citizens. Because they are completely handled by an extended unification routine, they do not require delay techniques needed in (more expressive) constraint systems. Still, their backtracking-superseding ‘closed’ representation leads to smaller proof trees (efficiency), and abstracted, intensional answers (readability). Anti-unification (for generalization) exchanges the roles of domains and exclusions. The operational semantics of domains, exclusions, and occurrence bindings is specified by a RELFUN meta-unify function (and implemented in pure LISP).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Harold Boley. A Relational/Functional Language and its Compilation into the WAM. Technical Report SEKI SR-90-05, University of Kaiserslautern, Department of Computer Science, April 1990.
Harold Boley. Extended Logic-plus-Functional Programming. In Proceedings of the 2nd International Workshop on Extensions of Logic Programming, ELP '91, Stockholm 1991, volume 596 of LNAI. Springer, 1992.
Harold Boley, Ulrich Buhrmann, and Christof Kremer. Towards a Sharable Knowledge Base on Recyclable Plastics. November 1993. To appear in: TMS'94 Symposium on Knowledge-Based Applications in Material Science and Engineering, Feb/Mar 1994, San Francisco, USA, TMS, Warrendale PA.
Alain Colmerauer. Introduction to Prolog III. In ESPRIT '87, pages 611–629. North Holland, 1987.
Cornelia Fischer. PANTUDE — An Anti-Unification Algorithm for Expressing Refined Generalizations. DFKI Kaiserslautern, February 1994.
Philipp Hanschke. A Declarative Integration of Terminological, Constraint-based, Data-driven, and Goal-directed Reasoning. Research Report RR-93-46, DFKI Kaiserslautern, October 1993.
Hans-Günter Hein. Propagation Techniques in WAM-based Architectures — The FIDO-III Approach. DFKI Technical Memo TM-93-04, DFKI Kaiserslautern, October 1993.
Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages (POPL), Munich, Germany, pages 111–119. ACM, January 1987.
John W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, Heidelberg, New York, 1987.
Manfred Meyer and Jörg Müller. Solving Configuration Tasks Efficiently Using Finite Domain Consistency Techniques. International Journal of Applied Intelligence, 1994. To appear.
Gordon D. Plotkin. A Note on Inductive Generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, pages 153–163. Elsevier North-Holland, New York, 1970.
Luc De Raedt. Interactive Theory Revision — An Inductive Logic Programming Approach. Academic Press, London, 1992.
Michael Sintek. FINDOM — Finite Domains in RELFUN Via Simulated Reassignment Variables. DFKI Kaiserslautern, June 1992.
Michael Sintek. FLIP: Functional-plus-Logic Programming on an Integrated Platform. 3rd Workshop on Functional Logic Programming, Schwarzenberg, Germany, January 1994.
Werner Stein. Nutzung globaler Analysetechniken in einem optimierenden Compiler für die Constraint-Logic-Programming-Sprache FIDO III. Diplomarbeit, Universität Kaiserslautern, FB Informatik, Juli 1993.
Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, Ma., 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boley, H. (1994). Finite domains and exclusions as first-class citizens. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_49
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive