Approximation fixpoint theory in Coq. With an application to logic programming
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A logic for default reasoning
- Approximating operators and semantics for abstract dialectical frameworks
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
- Fixpoint semantics for active integrity constraints
- Fixpoint semantics for logic programming a survey
- Fixpoint semantics for recursive \textsc{shacl}
- Flexible approximators for approximating fixpoint theory
- Grounded fixpoints and their applications in knowledge representation
- Hex semantics via approximation fixpoint theory
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- On the relation between default and autoepistemic logic
- Predicate introduction for logics with a fixpoint semantics. II: Autoepistemic logic
- Reiter's default logic is a logic of autoepistemic reasoning and a good one, too
- Safe inductions and their applications in knowledge representation
- Semantical considerations on nonmonotonic logic
- Set-theoretic and type-theoretic ordinals coincide
- Sets in Coq, Coq in Sets
- Splitting an operator: algebraic modularity results for logics with fixpoint semantics
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Une méthode d'élimination des nombres transfinis des raisonnements mathématiques.
- Uniform semantic treatment of default and autoepistemic logics
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- Well-founded and stable semantics of logic programs with aggregates
This page was built for publication: Approximation fixpoint theory in Coq. With an application to logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030789)
