scientific article
From MaRDI portal
Publication:3820058
zbMath0667.68111MaRDI QIDQ3820058
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilityProloglogic programnon-Horn clausescomplete proof proceduregeneralized closed world assumption
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items (9)
Generalized disjunctive well-founded semantics for logic programs. ⋮ Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete ⋮ Semantics of Horn and disjunctive logic programs ⋮ Paraconsistent disjunctive deductive databases ⋮ Parsing as non-Horn deduction ⋮ On reasoning about structural equality in XML: a description logic approach ⋮ An efficient strategy for non-Horn deductive databases ⋮ The semantics of incomplete databases as an expression of preferences ⋮ Weak generalized closed world assumption
This page was built for publication:
