Pages that link to "Item:Q1090469"
From MaRDI portal
The following pages link to Semantics of infinite tree logic programming (Q1090469):
Displaying 15 items.
- Logic programming with infinite sets (Q812390) (← links)
- Semantics for logic programs without occur check (Q913532) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Semantic trees for Dummett's logic LC (Q1092036) (← links)
- Recurrence domains: Their unification and application to logic programming (Q1900314) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
- Tabling, Rational Terms, and Coinduction Finally Together! (Q2931251) (← links)
- (Q3221399) (← links)
- Extending Co-logic Programs for Branching-Time Model Checking (Q3453651) (← links)
- Prolog infinite trees and automata (Q3991295) (← links)
- Algèbres effectives dans la programmation logique avec contraintes (Q4012670) (← links)
- Productive corecursion in logic programming (Q4592714) (← links)
- On Dual Programs in Co-Logic Programming (Q5743583) (← links)
- Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses (Q6647302) (← links)