What is failure? An approach to constructive negation
From MaRDI portal
Publication:1346220
DOI10.1007/BF01185404zbMath0815.68036OpenAlexW2034075659MaRDI QIDQ1346220
Publication date: 22 March 1995
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01185404
Related Items (6)
A necessary condition for constructive negation in constraint logic programming ⋮ On correctness of normal logic programs ⋮ An extended constraint deductive database: theory and implementation ⋮ Semantics of structured normal logic programs ⋮ A functorial framework for constraint normal logic programming ⋮ Constructive negation and constraint logic programming with sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strict completion of logic programs
- Equational problems and disunification
- A simple fixed point characterization of three-valued stable model semantics
- On the declarative and procedural semantics of logic programs
- A sound and complete semantics for a version of negation as failure
- A kripke-kleene semantics for logic programs*
- Complete logic programs with domain-closure axiom
- Negation in logic programming
- Tabulated resolution for the well-founded semantics
- Tight, consistent, and computable completions for unrestricted logic programs
- Proof method of partial correctness and weak completeness for normal logic programs
- The well-founded semantics for general logic programs
- Logic programming and negation: A survey
- A transformational approach to negation in logic programming
This page was built for publication: What is failure? An approach to constructive negation
