Strict completion of logic programs
From MaRDI portal
Publication:751309
DOI10.1007/BF03037151zbMath0714.68084OpenAlexW1969037975MaRDI QIDQ751309
Maurizio Martelli, Włodzimierz Drabent
Publication date: 1991
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03037151
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
What is failure? An approach to constructive negation ⋮ On Signings and the Well-Founded Semantics ⋮ On correctness of normal logic programs ⋮ Bottom-up evaluation and query optimization of well-founded models ⋮ Equivalence-preserving first-order unfold/fold transformation systems
Cites Work
- Unnamed Item
- Unnamed Item
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
- A completeness theorem for SLDNF resolution
- RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALS
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- A kripke-kleene semantics for logic programs*
- A basis for deductive database systems II
- Negation as failure. II
- Negation in logic programming
This page was built for publication: Strict completion of logic programs
