Tabulated resolution for the well-founded semantics

DOI10.1016/S0743-1066(97)00073-3zbMath0905.68024MaRDI QIDQ3841100

Roland N. Bol, Lars Degerstedt

Publication date: 5 November 1998

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

zbMATH Keywords

search spacesearch forest

Mathematics Subject Classification ID

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

Related Items (8)

A logic programming system for nonmonotonic reasoning ⋮ What is failure? An approach to constructive negation ⋮ Tabulation proof procedures for fuzzy linguistic logic programming ⋮ Dynamic reordering of alternatives for definite logic programs ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ The limits of fixed-order computation ⋮ Loop checks for logic programs with functions ⋮ Logic programming and knowledge representation---The A-Prolog perspective

This page was built for publication: Tabulated resolution for the well-founded semantics