TY - GEN
T1 - An engine for computing well-founded models
AU - Swift, Terrance
PY - 2009
Y1 - 2009
N2 - The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation's properties. Most tabling implementations have supported only call variance or, in the case of XSB Prolog, supported call subsumption only for stratified programs. However, call subsumption has proven critical for (sub-)model generation as required for some kinds of program analysis (e.g. type analysis) and for semantic web applications such as RDF inference. At the same time, the lack of well-founded negation has prevented the use of call subsumption in producing residual programs, and has limited its use in semantic web applications that require negation (e.g. evaluation of OWL ontologies). This paper describes an engine for evaluating normal programs under the well-founded semantics (WFS) in which the evaluation method can be based on a mixture of call subsumption and call variance, chosen at the predicate level. The implementation has been thoroughly tested for both local and batched evaluation and is available in version 3.2 of XSB.
AB - The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation's properties. Most tabling implementations have supported only call variance or, in the case of XSB Prolog, supported call subsumption only for stratified programs. However, call subsumption has proven critical for (sub-)model generation as required for some kinds of program analysis (e.g. type analysis) and for semantic web applications such as RDF inference. At the same time, the lack of well-founded negation has prevented the use of call subsumption in producing residual programs, and has limited its use in semantic web applications that require negation (e.g. evaluation of OWL ontologies). This paper describes an engine for evaluating normal programs under the well-founded semantics (WFS) in which the evaluation method can be based on a mixture of call subsumption and call variance, chosen at the predicate level. The implementation has been thoroughly tested for both local and batched evaluation and is available in version 3.2 of XSB.
KW - Tabling
KW - WAM
UR - http://www.scopus.com/inward/record.url?scp=69949181667&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=69949181667&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02846-5_45
DO - 10.1007/978-3-642-02846-5_45
M3 - Conference contribution
AN - SCOPUS:69949181667
SN - 3642028454
SN - 9783642028458
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 514
EP - 518
BT - Logic Programming - 25th International Conference, ICLP 2009, Proceedings
T2 - 25th International Conference on Logic Programming, ICLP 2009
Y2 - 14 July 2009 through 17 July 2009
ER -