Fixpoint semantics for recursive \textsc{shacl}
From MaRDI portal
Publication:6647306
DOI10.4204/eptcs.345.14MaRDI QIDQ6647306
Maxime Jakubowski, Bart Bogaerts
Publication date: 3 December 2024
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Internet topics (68M11)
Cites Work
- Approximating operators and semantics for abstract dialectical frameworks
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Grounded fixpoints and their applications in knowledge representation
- Fixpoint semantics for logic programming a survey
- Fixpoint semantics for active integrity constraints
- Uniform semantic treatment of default and autoepistemic logics
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Flexible Approximators for Approximating Fixpoint Theory
- An Introduction to Description Logic
- Well-founded and stable semantics of logic programs with aggregates
- The Semantics of Predicate Logic as a Programming Language
- Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
- Splitting an operator
Related Items (1)
Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
This page was built for publication: Fixpoint semantics for recursive \textsc{shacl}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647306)
