Search Results for author:
Found 37 papers, 7 papers with code
Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report
We present alternative approaches to routing and scheduling in Answer Set Programming (ASP), and explore them in the context of Multi-agent Path Finding.
On the generalization of learned constraints for ASP solving in temporal domains
Our question is now whether a constraint learned for particular time steps can be generalized and reused at other time stamps, and ultimately whether this enhances the overall solver performance on temporal problems.
Metric Dynamic Equilibrium Logic
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states.
Past-present temporal programs over finite traces
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications.
Bounded Combinatorial Reconfiguration with Answer Set Programming
The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022).
Metric Temporal Equilibrium Logic over Timed Traces
We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers.
$\textit{Clingraph}$: A System for ASP-based Visualization
We present the ASP-based visualization tool $\textit{clingraph}$ which aims at visualizing various concepts of ASP by means of ASP itself.
plingo: A system for probabilistic reasoning in clingo based on lpmln
We present plingo, an extension of the ASP system clingo with various probabilistic reasoning modes.
Answer Set Planning: A Survey
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, i. e., solutions to planning problems, that transform a given state of the world to another state.
Answer Set Programming Made Easy
We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming.
Automata for dynamic answer set solving: Preliminary report
On the one hand, we elaborate upon a transformation of dynamic formulas into alternating automata that relies on meta-programming in ASP.
Planning with Incomplete Information in Quantified Answer Set Programming
We present a general approach to planning with incomplete information in Answer Set Programming (ASP).
On the Foundations of Grounding in Answer Set Programming
We provide a comprehensive elaboration of the theoretical foundations of variable instantiation, or grounding, in Answer Set Programming (ASP).
Towards a Semantics for Hybrid ASP systems
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems.
Temporal Answer Set Programming
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving.
How to build your own ASP-based system?!
This is arguably due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science.
Towards Metric Temporal Answer Set Programming
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming.
eclingo: A solver for Epistemic Logic Programs
The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program.
Verifying Tight Logic Programs with anthem and Vampire
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories.
Train Scheduling with Hybrid Answer Set Programming
We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP).
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories.
Implementing Dynamic Answer Set Programming
We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications.
An ASP semantics for Constraints involving Conditional Aggregates
We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and variables.
ASP-Core-2 Input Language Format
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications.
Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
We address this prevalent problem in the context of car assembly at Mercedes-Benz Ludwigsfelde GmbH, a large-scale producer of commercial vehicles, where routes for automated guided vehicles used in the production process have traditionally been hand-coded by human engineers.
Experimenting with robotic intra-logistics domains
More precisely, asprilo consists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques.
Temporal Answer Set Programming on Finite Traces
In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces.
Efficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks
We propose encodings of the classical sequential pattern mining tasks within two representations of embeddings (fill-gaps vs skip-gaps) and for various kinds of patterns: frequent, constrained and condensed.
Clingo goes Linear Constraints over Reals and Integers
The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities.
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 system clingo.
Clingcon: The Next Generation
While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp.
Grounding Recursive Aggregates: Preliminary Report
In particular, we provide a series of algorithms detailing the treatment of recursive aggregates and illustrate this by a running example.
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques.
Solver Scheduling via Answer Set Programming
Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances and is known to depend strongly on algorithm parameters.
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
We here develop an alternative approach based on ASP.
A System for Interactive Query Answering with Answer Set Programming
Reactive answer set programming has paved the way for incorporating online information into operative solving processes.
ROSoClingo: A ROS package for ASP-based robot control
Knowledge representation and reasoning capacities are vital to cognitive robotics because they provide higher level cognitive functions for reasoning about actions, environments, goals, perception, etc.
