The following pages link to Horn clause computability (Q4132514):
Displaying 20 items.
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Grammatical unification (Q789185) (← links)
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (Q894695) (← links)
- A new combination of input and unit deductions for Horn sentences (Q1057665) (← links)
- Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797) (← links)
- Logic programming with external procedures: Introducing S-unification (Q1097682) (← links)
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic (Q1819946) (← links)
- Logic program forms (Q1822224) (← links)
- How expressive is stratified aggregation? (Q1924786) (← links)
- On computability by logic programs (Q1924787) (← links)
- Learning programs by learning from failures (Q2051282) (← links)
- Logical reduction of metarules (Q2203321) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- (Q3950550) (← links)
- A metalogic programming approach: language, semantics and applications (Q4305334) (← links)
- On the complexity of dataflow analysis of logic programs (Q5204343) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
