Broes De Cat

Broes De Cat
OMP

Phd in Civil Engineering - Computer Science - A.I.

About

22
Publications
3,518
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
313
Citations
Additional affiliations
September 2009 - August 2014
KU Leuven
Position
  • PhD Student

Publications

Publications (22)
Article
Full-text available
Declarative systems aim at solving tasks by running inference engines on a specification, to free their users from having to specify how a task should be tackled. In order to provide such functionality, declarative systems themselves apply complex reasoning techniques, and, as a consequence, the development of such systems can be laborious work. In...
Article
Full-text available
To appear in Theory and Practice of Logic Programming (TPLP). Dynamic systems play a central role in fields such as planning, verification, and databases. Fragmented throughout these fields, we find a multitude of languages to formally specify dynamic systems and a multitude of systems to reason on such specifications. Often, such systems are bound...
Article
Full-text available
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 some logic. The state-of-the-art approach for bounded model generation for rich knowledge representation languages, like ASP, FO(.) and Zinc, is ground-and-solve: reduce th...
Article
Full-text available
With the technology of the time, Kowalski's seminal 1974 paper Predicate Logic as a Programming Language was a breakthrough for the use of logic in computer science. The more recent tremendous progress in automated reasoning technologies, particularly in SAT solving and Constraint Programming, has paved the way for the use of logic as a modelling l...
Conference Paper
Full-text available
The traditional approach to Model Expansion (MX) is to reduce the theory to a propositional language and apply a search algorithm to the resulting theory. Function symbols are typically replaced by predicate symbols representing the graph of the function, an operation that blows up the reduced theory. In this paper, we present an improved approach...
Article
Full-text available
This paper explores the use of predicate logic as a modeling language. Using IDP3, a finite model generator that supports first order logic enriched with types, inductive definitions, aggregates and partial functions, search problems stated in a variant of predicate logic are solved. This variant is introduced and applied on a range of problems ste...
Article
Full-text available
Recent work in Answer Set Programming has integrated ideas from Constraint Programming. This has led to a new field called ASP Modulo CSP (CASP), in which the ASP language is enriched with constraint atoms representing constraint satisfaction problems. These constraints have a more compact grounding and are handled by a new generation of search alg...
Conference Paper
Full-text available
For constraint programming, many well performing dynamic symmetry breaking techniques have been devised. For propositional satisfiability solving, dynamic symmetry breaking is still either slower or less general than static symmetry breaking. This paper presents Symmetry Propagation, which is an improvement to Lightweight Dynamic Symmetry Breaking,...
Conference Paper
Full-text available
This paper reports on the use of the FO(·) language and the IDP framework for modeling and solving some machine learning and data mining tasks. The core component of a model in the IDP framework is an FO(·) theory consisting of formulas in first order logic and definitions; the latter are basically logic programs where clause bodies can have arbitr...
Conference Paper
Full-text available
Ground-and-solve methods used in state-of-the-art answer set programming and model expansion systems proceed by rewriting the problem specification into a ground format and afterwards applying search. A disadvantage of such approaches is that the rewriting step blows up the original specification for large input domains and is unfeasible in case of...
Article
Full-text available
Timetabling is the task of assigning sets of events to periods of time, taking into account resource-constraints and preferences among assignments. It is a well-studied field of research and is generally recog-nized to be a hard problem, both from the perspective of encoding it as from a computational point of view. In recent years, there has been...
Article
Full-text available
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is developed as an integration of two knowledge representation paradigms. The satisfiability problem for FO(FD) is...
Article
Full-text available
This paper presents the IDP system, a finite model generator for extended first-order logic theories. IDP can be used as a didactic tool in courses on (first-order) logic. It can also be applied to solve various constraint problems and for lightweight verification tasks.
Conference Paper
Full-text available
In many real-life computational search problems, one is not only interested in finding a solution, but also in maintaining a solution under varying circumstances. For example, in the area of network configuration, an initial configuration of a computer network needs to be obtained, but also a new configuration when one of the machines in the networ...

Network

Cited By