XSB: A system for efficiently computing well-founded semantics

Prasad Rao, Konstantinos Sagonas, Terrance Swift, David S. Warren, Juliana Freire

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB [19]. Performance results indicate that the overhead of delay and simplification to Prolog-or tabled-evaluations is minimal. To compute the well-founded semantics, the SLG-WAM adds to an efficient tabling engine for definite programs three operations-negative loop detection, delay and simplification-which serve to detect, to break and to resolve cycles through negation that might arise in evaluating normal programs. XSB is a full Prolog system that closely approximates the ISO standard; additionally, it supports a tight integration of tabled predicates with nontabled predicates.

LanguageEnglish (US)
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings
PublisherSpringer Verlag
Pages431-440
Number of pages10
Volume1265
ISBN (Print)9783540632559
StatePublished - 1997
Event4th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR 1997 - Dagstuhl Castle, Germany
Duration: Jul 28 1997Jul 31 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1265
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR 1997
CountryGermany
CityDagstuhl Castle
Period7/28/977/31/97

Fingerprint

Well-founded Semantics
Prolog
Predicate
Simplification
Semantics
Computing
Logic Programs
Resolve
Engine
Cycle
Evaluation
Engines
Model
Standards

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Rao, P., Sagonas, K., Swift, T., Warren, D. S., & Freire, J. (1997). XSB: A system for efficiently computing well-founded semantics. In Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings (Vol. 1265, pp. 431-440). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1265). Springer Verlag.

XSB : A system for efficiently computing well-founded semantics. / Rao, Prasad; Sagonas, Konstantinos; Swift, Terrance; Warren, David S.; Freire, Juliana.

Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings. Vol. 1265 Springer Verlag, 1997. p. 431-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1265).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rao, P, Sagonas, K, Swift, T, Warren, DS & Freire, J 1997, XSB: A system for efficiently computing well-founded semantics. in Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings. vol. 1265, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1265, Springer Verlag, pp. 431-440, 4th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR 1997, Dagstuhl Castle, Germany, 7/28/97.
Rao P, Sagonas K, Swift T, Warren DS, Freire J. XSB: A system for efficiently computing well-founded semantics. In Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings. Vol. 1265. Springer Verlag. 1997. p. 431-440. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Rao, Prasad ; Sagonas, Konstantinos ; Swift, Terrance ; Warren, David S. ; Freire, Juliana. / XSB : A system for efficiently computing well-founded semantics. Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings. Vol. 1265 Springer Verlag, 1997. pp. 431-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7aefb8735b5345dc9bc362cd07954c5a,
title = "XSB: A system for efficiently computing well-founded semantics",
abstract = "The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB [19]. Performance results indicate that the overhead of delay and simplification to Prolog-or tabled-evaluations is minimal. To compute the well-founded semantics, the SLG-WAM adds to an efficient tabling engine for definite programs three operations-negative loop detection, delay and simplification-which serve to detect, to break and to resolve cycles through negation that might arise in evaluating normal programs. XSB is a full Prolog system that closely approximates the ISO standard; additionally, it supports a tight integration of tabled predicates with nontabled predicates.",
author = "Prasad Rao and Konstantinos Sagonas and Terrance Swift and Warren, {David S.} and Juliana Freire",
year = "1997",
language = "English (US)",
isbn = "9783540632559",
volume = "1265",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "431--440",
booktitle = "Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings",

}

TY - GEN

T1 - XSB

T2 - A system for efficiently computing well-founded semantics

AU - Rao, Prasad

AU - Sagonas, Konstantinos

AU - Swift, Terrance

AU - Warren, David S.

AU - Freire, Juliana

PY - 1997

Y1 - 1997

N2 - The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB [19]. Performance results indicate that the overhead of delay and simplification to Prolog-or tabled-evaluations is minimal. To compute the well-founded semantics, the SLG-WAM adds to an efficient tabling engine for definite programs three operations-negative loop detection, delay and simplification-which serve to detect, to break and to resolve cycles through negation that might arise in evaluating normal programs. XSB is a full Prolog system that closely approximates the ISO standard; additionally, it supports a tight integration of tabled predicates with nontabled predicates.

AB - The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB [19]. Performance results indicate that the overhead of delay and simplification to Prolog-or tabled-evaluations is minimal. To compute the well-founded semantics, the SLG-WAM adds to an efficient tabling engine for definite programs three operations-negative loop detection, delay and simplification-which serve to detect, to break and to resolve cycles through negation that might arise in evaluating normal programs. XSB is a full Prolog system that closely approximates the ISO standard; additionally, it supports a tight integration of tabled predicates with nontabled predicates.

UR - http://www.scopus.com/inward/record.url?scp=84946748559&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946748559&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540632559

VL - 1265

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 431

EP - 440

BT - Logic Programming and Nonmonotonic Reasoning - 4th International Conference, LPNMR 1997, Proceedings

PB - Springer Verlag

ER -