An abstract machine for efficiently computing queries to well-founded models

DOI10.1016/S0743-1066(00)00005-4zbMath0957.68019OpenAlexW1994977110WikidataQ58968475 ScholiaQ58968475MaRDI QIDQ4507851

David S. Warren, Terrance Swift, Konstantinos Sagonas

Publication date: 10 October 2000

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(00)00005-4

zbMATH Keywords

well-founded semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (3)

A new approach to hybrid probabilistic logic programs ⋮ Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ A three-valued semantics for querying and repairing inconsistent databases

Uses Software

• Smodels
• XSB

This page was built for publication: An abstract machine for efficiently computing queries to well-founded models