scientific article; zbMATH DE number 3782373

MaRDI QIDQ3960112zbMATH OpenFDO

Authors István Németi, Hajnal Andréka

Publication date 1978

zbMATH Keywords

Herbrand-universeHorn clausesprolog-like languages

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)

Cited in

(15)

• Why Horn formulas matter in computer science: initial structures and generic examples
• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• A complete logic for reasoning about programs via nonstandard model theory. I
• How complicated is the set of stable models of a recursive logic program?
• Paraconsistent logic programming
• Definite clause programs are canonical (over a suitable domain)
• Revision programming
• 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
• Copy complexity of Horn formulas with respect to unit read-once resolution
• Recursive programs and denotational semantics in absolute logics of programs
• Horn clause computability
• Index sets for finite normal predicate logic programs with function symbols
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960112)