Tabling for non-monotonic programming

DOI10.1023/A:1018990308362zbMath0940.68025OpenAlexW1520935955WikidataQ56059058 ScholiaQ56059058MaRDI QIDQ1978007

Terrance Swift

Publication date: 7 June 2000

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018990308362

zbMATH Keywords

logic programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic programming (68N17)

Related Items (12)

XSB: Extending Prolog with Tabled Logic Programming ⋮ Termination of logic programs with imperfect information: applications and query procedure ⋮ A Framework for Goal-Directed Query Evaluation with Negation ⋮ Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics ⋮ Tabling with Sound Answer Subsumption ⋮ Tabulation proof procedures for fuzzy linguistic logic programming ⋮ Unnamed Item ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ The PITA system: Tabling and answer subsumption for reasoning under uncertainty ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ Preference Logic Grammars: Fixed point semantics and application to data standardization

Uses Software

• XSB

This page was built for publication: Tabling for non-monotonic programming