Efficient evaluation of a class of ordered logic programs

DOI10.1016/S0169-023X(96)00050-XMaRDI QIDQ4398692zbMATH OpenFDO

Authors N. Leone, Clara Pizzutit, Pasquale Rullo

Publication date 22 July 1998

Published in Data & Knowledge Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0169-023X(96)00050-X

zbMATH Keywords

fixpoint semanticsordered logic programmingquasi-stratified programswell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Well-founded semantics and stratification for ordered logic programs
• Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
• A Fixpoint Semantics for Ordered Logic
• Ordered Logic Programming with Sets

Cited in

(11)

• Well-founded semantics and stratification for ordered logic programs
• Dynamic reordering of alternatives for definite logic programs
• A partial evaluation framework for order-sorted equational programs modulo axioms
• Efficient evaluation methods for guarded logics and Datalog LITE (abstract)
• An efficient reasoning method on logic programming using partial evaluation in vector spaces
• Comparison of Scoring and Order Approach in Description Logic $\mathcal{EL(D)}$
• Fast Offline Partial Evaluation of Large Logic Programs
• Stratified partial-order logic programming
• plp: A generic compiler for ordered logic programs
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• Enhancing disjunctive logic programming systems by SAT checkers

This page was built for publication: Efficient evaluation of a class of ordered logic programs

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