Proof-theoretic foundations of normal logic programs

DOI10.1007/978-3-031-31476-6_13zbMath1529.68073OpenAlexW4376854090MaRDI QIDQ6175112

Elmer Salazar, Unnamed Author

Publication date: 17 August 2023

Published in: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31476-6_13

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circular Coinduction: A Proof Theoretical Foundation
• Infinite Computation, Co-induction and Computational Logic
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Constraint Answer Set Programming without Grounding
• A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns
• Founded semantics and constraint semantics of logic rules
• Basic Category Theory
• Co-Logic Programming: Extending Logic Programming with Coinduction
• On Dual Programs in Co-Logic Programming

This page was built for publication: Proof-theoretic foundations of normal logic programs