On dual programs in co-logic programming and the Horn -calculus

DOI10.1007/S00165-016-0404-0MaRDI QIDQ2628297zbMATH OpenOpenAlexWikidataFDO

Authors 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 programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Coalgebraic logics \& duality
• Co-Logic Programming: Extending Logic Programming with Coinduction
• A theoretical perspective of coinductive logic programming
• Coalgebraic logic programming: from Semantics to Implementation
• scientific article; zbMATH DE number 1497877
• Coinductive Logic Programming and Its Applications
• Towards coinductive theory exploration in Horn clause logic: position paper
• Coalgebraic derivations in logic programming
• scientific article; zbMATH DE number 7297837

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 1392287 (Why is no real title available?)
• A procedural semantics for well-founded negation in logic programs
• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Coinductive Logic Programming
• Coinductive Logic Programming and Its Applications
• Dynamic consistency checking in goal-directed answer set programming
• Extending co-logic programs for branching-time model checking
• Fixpoint semantics for logic programming a survey
• Infinite computation, co-induction and computational logic
• Partial evaluation in logic programming
• Proving properties of co-logic programs by unfold/fold transformations
• Proving properties of co-logic programs with negation by program transformations
• SWI-Prolog
• Semantics of infinite tree logic programming
• ω-Automata

Cited in

(3)

• On dual programs in co-logic programming
• Proving properties of co-logic programs with negation by program transformations
• Extending co-logic programs for branching-time model checking

Describes a project that uses

Uses Software

• SWI-Prolog

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628297)