Horn clause computability

DOI10.1007/BF01932293zbMath0359.02042MaRDI QIDQ4132514

Sten-Åke Tärnlund

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (20)

Why Horn formulas matter in computer science: initial structures and generic examples ⋮ Logic programming with external procedures: Introducing S-unification ⋮ A metalogic programming approach: language, semantics and applications ⋮ How expressive is stratified aggregation? ⋮ On computability by logic programs ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited ⋮ Logical reduction of metarules ⋮ Automatic theorem proving. II ⋮ Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs ⋮ Unnamed Item ⋮ Disjunctive ASP with functions: Decidable queries and effective computation ⋮ On the complexity of dataflow analysis of logic programs ⋮ Learning programs by learning from failures ⋮ Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic ⋮ Semantics of algorithmic languages ⋮ Logic program forms ⋮ Grammatical unification ⋮ A new combination of input and unit deductions for Horn sentences

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Horn clause computability