Négation constructive et axiomatique interne

DOI10.1051/ita/1997310504111zbMath0893.68025OpenAlexW2485821868MaRDI QIDQ4385672

No author found.

Publication date: 2 June 1998

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92569

zbMATH Keywords

constraint programmingconstructive negationbivalued semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Model theory.
• Complete extension of general logic programs
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Completeness of SLDNF-resolution for nonfloundering queries
• A kripke-kleene semantics for logic programs*
• Sémantique logique et dénotationnelle des interpréteurs PROLOG
• Negation in logic programming
• Constructive negation by pruning
• Theorem-Proving for Computers: Some Results on Resolution and Renaming

This page was built for publication: Négation constructive et axiomatique interne