Horn clause computability
From MaRDI portal
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 3782373 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
Cited in
(21)- A new combination of input and unit deductions for Horn sentences
- Why Horn formulas matter in computer science: initial structures and generic examples
- Logic programming with external procedures: Introducing S-unification
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic
- Logic program forms
- How expressive is stratified aggregation?
- On computability by logic programs
- Learning programs by learning from failures
- Logical reduction of metarules
- Disjunctive ASP with functions: decidable queries and effective computation
- Automatic theorem proving. II
- scientific article; zbMATH DE number 3769610 (Why is no real title available?)
- A metalogic programming approach: language, semantics and applications
- On the complexity of dataflow analysis of logic programs
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
- Peano arithmetic and MALL
- Semantics of algorithmic languages
- Grammatical unification
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
This page was built for publication: Horn clause computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132514)
