53 citations · 128 across the 16 of their papers we have counts for
10 papers · 1 filter
Justifications and a Reconstruction of Parity Game Solving Algorithms
Ruben Lapauw, Maurice Bruynooghe, Marc Denecker
Parity games are infinite two-player games played on directed graphs. Parity game solvers are used in the domain of formal verification. This paper defines parametrized parity game…
On Local Domain Symmetry for Model Expansion
Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe +1
Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of…
Lazy Model Expansion: Interleaving Grounding with Search
Broes De Cat, Marc Denecker, Peter Stuckey +1
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in so…
Predicate Logic as a Modelling Language: The IDP System
Broes De Cat, Bart Bogaerts, Maurice Bruynooghe +2
With the technology of the time, Kowalski's seminal 1974 paper {\em Predicate Logic as a Programming Language} was a breakthrough for the use of logic in computer science. It intro…
Constraint Propagation for First-Order Logic and Inductive Definitions
Johan Wittocx, Marc Denecker, Maurice Bruynooghe
Constraint propagation is one of the basic forms of inference in many logic-based reasoning systems. In this paper, we investigate constraint propagation for first-order logic (FO)…
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code
K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor +1
Development of energy and performance-efficient embedded software is increasingly relying on application of complex transformations on the critical parts of the source code. Design…
Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning
Ofer Arieli, Marc Denecker, Bert Van Nuffelen +1
In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to `rep…
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
Nikolay Pelov, Maurice Bruynooghe
Proving failure of queries for definite logic programs can be done by constructing a finite model of the program in which the query is false. A general purpose model generator for…
Detecting Unsolvable Queries for Definite Logic Programs
Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal +1
In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachab…
A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems
Nikolay Pelov, Emmanuel De Mot, Maurice Bruynooghe
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there are definite programs and constraint logic programs t…