Search Results for author:
Found 8 papers, 3 papers with code
Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming
Additionally, we use our approach to implement informed} search with A*, which is tackled within ASP for the first time.
Proceedings 36th International Conference on Logic Programming (Technical Communications)
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase Saving, Heuristics, and More
Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI.
Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
We demonstrate the effects of our method by means of realistic examples, showing that our approach requires low computational cost to learn constraints that yield significant performance benefits in our test cases.
Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP
Domain-specific heuristics are an important technique for solving combinatorial problems efficiently.
Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving
Our contributions are the introduction of a range of novel lazy grounding strategies, a formal account on their relationships and their correctness, and an investigation of their effects on solving performance.
The Partner Units Configuration Problem: Completing the Picture
The partner units problem (PUP) is an acknowledged hard benchmark problem for the Logic Programming community with various industrial application fields like surveillance, electrical engineering, computer networks or railway safety systems.
Interactive ontology debugging: two query strategies for efficient fault localization
The latter allows knowledge about typical user errors to be exploited to minimize the number of queries.
