The following pages link to Marc Denecker (Q598244):
Displaying 50 items.
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- FO(ID) as an extension of DL with rules (Q604911) (← links)
- Improving parity game solvers with justifications (Q784159) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- Inductive situation calculus (Q1028914) (← links)
- On the duality of abduction and model generation in a framework for model generation with equality (Q1314425) (← links)
- Safe inductions and their applications in knowledge representation (Q1647517) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- Explaining actual causation in terms of possible causal processes (Q2296707) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- Distance semantics for database repair (Q2457795) (← links)
- Computational methods for database repair by signed formulae (Q2502158) (← links)
- (Q2734934) (← links)
- (Q2767022) (← links)
- (Q2767097) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
- Simulating Dynamic Systems Using Linear Time Calculus Theories (Q2931258) (← links)
- Constraint Propagation for First-Order Logic and Inductive Definitions (Q2946703) (← links)
- Coherent Composition of Distributed Knowledge-Bases through Abduction (Q2996197) (← links)
- Answer Set Programming’s Contributions to Classical Logic (Q3001911) (← links)
- (Q3089163) (← links)
- (Q3100243) (← links)
- An approximative inference method for solving ∃∀SO satisfiability problems (Q3143568) (← links)
- CP-logic: A language of causal probabilistic events and its relation to logic programming (Q3393227) (← links)
- Well-founded and stable semantics of logic programs with aggregates (Q3432854) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- Integrating Inductive Definitions in SAT (Q3498482) (← links)
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (Q3502709) (← links)
- Distance-Based Repairs of Databases (Q3533120) (← links)
- Representing Causal Information About a Probabilistic Process (Q3533152) (← links)
- Grounding FO and FO(ID) with Bounds (Q3563101) (← links)
- FO(FD): Extending classical logic with rule-based fixpoint definitions (Q3585169) (← links)
- A Deductive System for FO(ID) Based on Least Fixpoint Logic (Q3643111) (← links)
- SLDNFA: An abductive procedure for abductive logic programs (Q3841101) (← links)
- (Q4246955) (← links)
- On the relation between situation calculus and event calculus (Q4352527) (← links)
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment (Q4434614) (← links)
- (Q4472206) (← links)
- (Q4506391) (← links)
- (Q4518430) (← links)
- Semantics of templates in a compositional framework for building logics (Q4593008) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- On local domain symmetry for model expansion (Q4593047) (← links)
- The KB paradigm and its application to interactive configuration (Q4593081) (← links)
- (Q4707746) (← links)
- (Q4736514) (← links)
- Representing Incomplete Knowledge in Abductive Logic Programming (Q4849644) (← links)
- CHICA, An Abductive Planning System Based on Event Calculus (Q4849646) (← links)
- (Q4906886) (← links)
