Anzeige
Erschienen in:
2003 | OriginalPaper | Buchkapitel
A New Mode Declaration for Tabled Predicates
verfasst von : Hai-Feng Guo, Gopal Gupta
Erschienen in: Logic Programming
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A tabled logic programming (TLP) system can be thought of as an engine for efficiently computing fixed points. In a TLP system, a global data structure table is introduced to memorize the answers of any subgoals to tabled predicates, whose purpose is to never do the same computation twice. Consider the tabled predicate reach/2 defined as follows for the reachability relation. Given a query reach(a,X), a TLP system returns answers X=b, X=c and X=a, albeit the predicate is defined left-recursively.