Multi-shot ASP solving with clingo
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming
(ASP), which we refer to as multi-shot ASP solving, and present its implementation in the …
(ASP), which we refer to as multi-shot ASP solving, and present its implementation in the …
Clingo= ASP+ control: Preliminary report
We present the new ASP system clingo 4. Unlike its predecessors, being mere monolithic
combinations of the grounder gringo with the solver clasp, the new clingo 4 series offers …
combinations of the grounder gringo with the solver clasp, the new clingo 4 series offers …
Decisions, advice and explanation: an overview and research agenda
J Vanthienen - A Research Agenda for Knowledge Management …, 2021 - elgaronline.com
Operational decisions are made on a daily basis, but they require a lot of knowledge
(Vanthienen, 2015). Such decisions are taken frequently and are repetitive in nature (eg …
(Vanthienen, 2015). Such decisions are taken frequently and are repetitive in nature (eg …
Clingcon: The next generation
M Banbara, B Kaufmann, M Ostrowski… - Theory and Practice of …, 2017 - cambridge.org
We present the third generation of the constraint answer set system clingcon, combining
Answer Set Programming (ASP) with finite domain constraint processing (CP). While its …
Answer Set Programming (ASP) with finite domain constraint processing (CP). While its …
[HTML][HTML] A framework for step-wise explaining how to solve constraint satisfaction problems
We explore the problem of step-wise explaining how to solve constraint satisfaction
problems, with a use case on logic grid puzzles. More specifically, we study the problem of …
problems, with a use case on logic grid puzzles. More specifically, we study the problem of …
Step-wise explanations of constraint satisfaction problems
We explore the problem of step-wise explaining how to solve constraint satisfaction
problems, with a use case on logic grid puzzles. More specifically, we study the problem of …
problems, with a use case on logic grid puzzles. More specifically, we study the problem of …
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
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 …
of IDP3 is a finite model generator that supports first-order logic enriched with types …
Fixpoint semantics for recursive SHACL
SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs.
The recommendation only specifies semantics for non-recursive SHACL; recently, some …
The recommendation only specifies semantics for non-recursive SHACL; recently, some …
Lazy model expansion: Interleaving grounding with search
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 …
as a (bounded) model generation problem: search for (bounded) models of a theory in some …
Simplifying step-wise explanation sequences
Explaining constraint programs is useful for debugging an unsatisfiable program, to
understand why a given solution is optimal, or to understand how to find a unique solution. A …
understand why a given solution is optimal, or to understand how to find a unique solution. A …