Semantics of infinite tree logic programming

DOI10.1016/0304-3975(86)90027-7zbMath0621.68054OpenAlexW2091154692WikidataQ55921413 ScholiaQ55921413MaRDI QIDQ1090469

Peter J. Stuckey, Joxan Jaffar

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90027-7

zbMATH Keywords

inequalitiesPROLOGunificationsemanticscompleted programconsequence in all Herbrand modelsinfinite tree logic programmingsatisfier

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items

On dual programs in co-logic programming and the Horn \({\mu}\)-calculus, Extending Co-logic Programs for Branching-Time Model Checking, Tabling, Rational Terms, and Coinduction Finally Together!, Algèbres effectives dans la programmation logique avec contraintes, On inductive inference of cyclic structures, Productive corecursion in logic programming, Semantics for logic programs without occur check, On Dual Programs in Co-Logic Programming, On the algebraic structure of declarative programming languages

Cites Work

• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Fundamental properties of infinite trees
• A theory of complete logic programs with equality
• A logical reconstruction of Prolog II
• The Semantics of Predicate Logic as a Programming Language