On dual programs in co-logic programming and the Horn \({\mu}\)-calculus

DOI10.1007/s00165-016-0404-0zbMath1362.68058OpenAlexW2560482109MaRDI QIDQ2628297

Hirohisa Seki

Publication date: 1 June 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0404-0

zbMATH Keywords

dual programsanswer set programming (ASP)co-logic programmingthe Horn \({\mu}\)-calculusthe well-founded semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• SWI-Prolog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics of infinite tree logic programming
• Fixpoint semantics for logic programming a survey
• Proving Properties of Co-logic Programs with Negation by Program Transformations
• SWI-Prolog
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Dynamic Consistency Checking in Goal-Directed Answer Set Programming
• Infinite Computation, Co-induction and Computational Logic
• Extending Co-logic Programs for Branching-Time Model Checking
• Coinductive Logic Programming and Its Applications
• Partial evaluation in logic programming
• A procedural semantics for well-founded negation in logic programs
• ω-Automata
• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Proving Properties of Co-Logic Programs by Unfold/Fold Transformations
• Coinductive Logic Programming

This page was built for publication: On dual programs in co-logic programming and the Horn \({\mu}\)-calculus