On dual programs in co-logic programming
From MaRDI portal
Publication:5743583
DOI10.1007/978-3-319-27436-2_2zbMATH Open1362.68057OpenAlexW2406431943MaRDI QIDQ5743583FDOQ5743583
Authors: Hirohisa Seki 
Publication date: 5 February 2016
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27436-2_2
Recommendations
Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)
Cites Work
- SWI-Prolog
- Title not available (Why is that?)
- Infinite computation, co-induction and computational logic
- Title not available (Why is that?)
- Fixpoint semantics for logic programming a survey
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- Dynamic consistency checking in goal-directed answer set programming
- ω-Automata
- Semantics of infinite tree logic programming
- Coinductive Logic Programming
- Extending co-logic programs for branching-time model checking
- Proving properties of co-logic programs by unfold/fold transformations
- Title not available (Why is that?)
- Proving properties of co-logic programs with negation by program transformations
- Coinductive Logic Programming and Its Applications
Cited In (5)
Uses Software
This page was built for publication: On dual programs in co-logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743583)
