scientific article
From MaRDI portal
Publication:3960112
zbMath0496.68021MaRDI QIDQ3960112
Istvan Németi, Hajnalka Andréka
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items (15)
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols ⋮ Why Horn formulas matter in computer science: initial structures and generic examples ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ Definite clause programs are canonical (over a suitable domain) ⋮ The expressiveness of locally stratified programs ⋮ Complexity and undecidability results for logic programming ⋮ A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs ⋮ Revision programming ⋮ Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks ⋮ Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete ⋮ A complete logic for reasoning about programs via nonstandard model theory. I ⋮ Copy complexity of Horn formulas with respect to unit read-once resolution ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Horn clause computability ⋮ Paraconsistent logic programming
This page was built for publication:
