Výsledky vyhledávání - "Broes De Cat"

User-Friendly Programming of Flexible Assembly Applications with Collaborative Robots

Autor: Patricia Leconte, Asad Tirmizi, Karel Janssen, Maarten Witters, Yudha Pane, Broes De Cat

Publikováno v: 2019 20th International Conference on Research and Education in Mechatronics (REM).

This paper proposes a framework to make the programming of cobots faster, user-friendly and flexible for assembly tasks. The work focusses on an industrial case of a small (

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bba2557ec24ea9064de47c69bafe7e11
https://doi.org/10.1109/rem.2019.8744135

Zobrazit plný text záznamu

Detection and exploitation of functional dependencies for model generation

Autor: Broes De Cat, Maurice Bruynooghe

Publikováno v: Theory and Practice of Logic Programming. 13:471-485

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 problem

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::428db011f6ca56e945c210a439a1511f
https://doi.org/10.1017/s147106841300029x

Zobrazit plný text záznamu

FO(FD): Extending classical logic with rule-based fixpoint definitions

Autor: Marc Denecker, Hou Ping, Broes De Cat

Publikováno v: Theory and Practice of Logic Programming. 10:581-596

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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1c93d3bc2de3aeac642b4ae4c911887
https://doi.org/10.1017/s1471068410000293

Zobrazit plný text záznamu

Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3

Autor: Marc Denecker, Stef De Pooter, Hendrik Blockeel, Anthony Labarre, Broes De Cat, Jan Ramon, Joachim Jansen, Sicco Verwer, Bart Bogaerts, Maurice Bruynooghe

This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 is a finite model generator that supports first order logic enriched with types, inductive definitions, aggregates and partial functions. It offers it

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d1ec40aadfe2652756cb694af8696be
https://hdl.handle.net/1887/3197539

Zobrazit plný text záznamu

Simulating dynamic systems using linear time calculus theories

Autor: Broes De Cat, Maurice Bruynooghe, Joost Vennekens, Joachim Jansen, Bart Bogaerts, Marc Denecker

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 specifi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9ce73c936da164e55cd3bee0b39ee5f
https://lirias.kuleuven.be/handle/123456789/451582

Zobrazit plný text záznamu

Lazy Model Expansion: Interleaving Grounding with Search

Autor: Marc Denecker, Maurice Bruynooghe, Broes De Cat, Peter J. Stuckey

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 f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c653e3da124b5ec4b9800cb0fc198a0

Zobrazit plný text záznamu

Model Expansion in the Presence of Function Symbols Using Constraint Programming

Autor: Marc Denecker, Bart Bogaerts, Jo Devriendt, Broes De Cat

Publikováno v: ICTAI

The traditional approach to model expansion (generating models of a logic theory extending a partial structure) is to reduce the theory to a propositional language and apply a search algorithm to the resulting theory. Function symbols are typically r

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfe75b0cd15728c1400aad172f4f1a09
https://doi.org/10.1109/ictai.2013.159

Zobrazit plný text záznamu

Symmetry propagation: Improved dynamic symmetry breaking in SAT

Autor: Christopher Mears, Marc Denecker, Bart Bogaerts, Jo Devriendt, Broes De Cat

Publikováno v: ICTAI

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 pa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::735f993e4923c7a09df4a54ee916320a
https://lirias.kuleuven.be/handle/123456789/360234

Zobrazit plný text záznamu

Towards computing revised models for FO theories

Autor: Johan Wittocx, Marc Denecker, Broes De Cat

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642205880
INAP

In many real-life computational search problems, one is not only interested in finding a solution, but also in maintaining it under varying circumstances. E.g., in the area of network configuration, an initial configuration of a computer network need

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e2566d002f51a1f3b83d372d528da54
https://lirias.kuleuven.be/handle/123456789/242185

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání