Computation of non-ground disjunctive well-founded semantics with constraint logic programming

DOI10.1007/BFB0023808MaRDI QIDQ6623800zbMATH OpenFDO

Authors J. Dix, Frieder Stolzenburg

Publication date 24 October 2024

Full work available at URL https://doi.org/10.1007/BFB0023808

zbMATH Keywords

constraint logic programmingdisjunctive logic programmingequational constraintsnonmonotonic reasoningwell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• A framework to incorporate non-monotonic reasoning into constraint logic programming
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Logic Programming
• Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
• Comparisons and computation of well-founded semantics for disjunctive logic programs

Cites work

• Characterizing D-WFS: confluence and iterated GCWA
• Computing minimal models by partial instantiation
• Equational problems and disunification
• scientific article; zbMATH DE number 870438 (Why is no real title available?)
• Tabled evaluation with delaying for general logic programs

This page was built for publication: Computation of non-ground disjunctive well-founded semantics with constraint logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623800)