On Nested Justification Systems | 0 | 0.34 | 2022 |

Exploiting Game Theory for Analysing Justifications | 0 | 0.34 | 2020 |

An Interactive Consultant. | 0 | 0.34 | 2019 |

Explaining Actual Causation in Terms of Possible Causal Processes. | 0 | 0.34 | 2019 |

The informal semantics of Answer Set Programming: A Tarskian perspective. | 0 | 0.34 | 2019 |

Safe inductions and their applications in knowledge representation. | 0 | 0.34 | 2018 |

Transpiling Programmable Computable Functions to Answer Set Programs. | 0 | 0.34 | 2018 |

On Well-Founded Set-Inductions and Locally Monotone Operators. | 0 | 0.34 | 2016 |

Resilient Delegation Revocation with Precedence for Predecessors Is NP-Complete | 1 | 0.36 | 2016 |

Consistent Integration of Decision (DMN) and Process (BPMN) Models. | 10 | 0.66 | 2016 |

Combining DMN and the Knowledge Base Paradigm for Flexible Decision Enactment. | 2 | 0.40 | 2016 |

The KB Paradigm and Its Application to Interactive Configuration. | 0 | 0.34 | 2016 |

First Order Logic with Inductive Definitions for Model-Based Problem Solving. | 0 | 0.34 | 2016 |

Distributed Autoepistemic Logic and its Application to Access Control. | 1 | 0.36 | 2016 |

Relevance for SAT(ID). | 0 | 0.34 | 2016 |

Grounded Fixpoints. | 0 | 0.34 | 2015 |

Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. | 12 | 0.53 | 2015 |

Visualising interactive inferences with IDPD3 | 1 | 0.38 | 2015 |

An Exercise In Declarative Modeling For Relational Query Mining | 4 | 0.40 | 2015 |

Partial Grounded Fixpoints. | 1 | 0.35 | 2015 |

Semantics of templates in a compositional framework for building logics | 3 | 0.43 | 2015 |

Modelling Delegation and Revocation Schemes in IDP. | 0 | 0.34 | 2014 |

The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited. | 7 | 0.45 | 2014 |

Interactions between knowledge and time in a first-order logic for multi-agent systems: completeness results | 7 | 0.50 | 2014 |

Lazy Model Expansion: Interleaving Grounding with Search. | 10 | 0.62 | 2014 |

Simulating dynamic systems using Linear Time Calculus theories. | 1 | 0.37 | 2014 |

FO(C) and Related Modelling Paradigms. | 2 | 0.38 | 2014 |

Constraint Propagation for First-Order Logic and Inductive Definitions | 3 | 0.37 | 2013 |

The effects of buying a new car: an extension of the IDP Knowledge Base System. | 1 | 0.38 | 2013 |

Extending FO(ID) with Knowledge Producing Definitions: Preliminary Results | 0 | 0.34 | 2013 |

Approximation fixpoint theory and the semantics of logic and answers set programs | 4 | 0.41 | 2012 |

A general representation and approximate inference algorithm for sensing actions | 3 | 0.39 | 2012 |

LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions | 0 | 0.34 | 2012 |

Lazy Model Expansion by Incremental Grounding. | 6 | 0.45 | 2012 |

A Tarskian Informal Semantics for Answer Set Programming. | 17 | 0.71 | 2012 |

Answer set programming's contributions to classical logic: an analysis of ASP methodology | 3 | 0.42 | 2011 |

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too | 5 | 0.40 | 2011 |

An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability Problems | 0 | 0.34 | 2010 |

Towards a logical reconstruction of a theory for locally closed databases | 16 | 0.75 | 2010 |

Using local alignments for relation recognition | 2 | 0.36 | 2010 |

Embracing events in causal modelling: interventions and counterfactuals in CP-ogic | 1 | 0.41 | 2010 |

Using Lightweight Inference to Solve Lightweight Problems | 0 | 0.34 | 2009 |

A Knowledge Base System Project for FO(.) | 1 | 0.37 | 2009 |

Cp-logic: A language of causal probabilistic events and its relation to logic programming | 55 | 2.12 | 2009 |

The Second Answer Set Programming Competition | 68 | 2.15 | 2009 |

A Deductive System for FO(ID) Based on Least Fixpoint Logic | 0 | 0.34 | 2009 |

Towards computing revised models for FO theories | 2 | 0.47 | 2009 |

A logic of nonmonotone inductive definitions | 35 | 1.28 | 2008 |

Complexity of First Order ID-Logic | 0 | 0.34 | 2008 |

SAT(ID): satisfiability of propositional logic extended with inductive definitions | 29 | 0.89 | 2008 |