Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Taupe P"'
Autor:
Comploi-Taupe, Richard
Publikováno v:
EPTCS 385, 2023, pp. 129-140
Domain-specific heuristics are a crucial technique for the efficient solving of problems that are large or computationally hard. Answer Set Programming (ASP) systems support declarative specifications of domain-specific heuristics to improve solving
Externí odkaz:
http://arxiv.org/abs/2308.15863
Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Programming (ASP) are unsatisfactory when dealing with heuristics that ar
Externí odkaz:
http://arxiv.org/abs/2209.09066
In this paper, we apply incremental answer set solving to product configuration. Incremental answer set solving is a step-wise incremental approach to Answer Set Programming (ASP). We demonstrate how to use this technique to solve product configurati
Externí odkaz:
http://arxiv.org/abs/2207.08599
Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-solve approach, however, requires ASP programs to be grounded upfront
Externí odkaz:
http://arxiv.org/abs/2008.03526
Generalising and re-using knowledge learned while solving one problem instance has been neglected by state-of-the-art answer set solvers. We suggest a new approach that generalises learned nogoods for re-use to speed-up the solving of future problem
Externí odkaz:
http://arxiv.org/abs/2008.03100
Autor:
Taupe, Richard, Schekotihin, Konstantin, Schüller, Peter, Weinzierl, Antonius, Friedrich, Gerhard
Publikováno v:
EPTCS 306, 2019, pp. 22-35
Domain-specific heuristics are an important technique for solving combinatorial problems efficiently. We propose a novel semantics for declarative specifications of domain-specific heuristics in Answer Set Programming (ASP). Decision procedures that
Externí odkaz:
http://arxiv.org/abs/1909.08231
Publikováno v:
In: Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science, vol 11481. Springer, Cham
The traditional ground-and-solve approach to Answer Set Programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that interleaves grounding with solving a
Externí odkaz:
http://arxiv.org/abs/1903.12510
Autor:
Andreas Falkner, Alois Haselböck, Gerfried Krames, Gottfried Schenner, Herwig Schreiner, Richard Taupe
Publikováno v:
Journal of Universal Computer Science, Vol 26, Iss 3, Pp 343-373 (2020)
Interactive configuration includes the user as an essential factor in the configuration process. The two main components of an interactive configurator are a user interface at the front-end and a knowledge representation and reasoning (KRR) framework
Externí odkaz:
https://doaj.org/article/6a2e4b1ec94747f1b454d19907db8e4b
Autor:
Stephan Schraml, Michael Hubner, Philip Taupe, Michael Hofstätter, Philipp Amon, Dieter Rothbacher
Publikováno v:
Sensors, Vol 22, Iss 23, p 9198 (2022)
Rapid and accurate reconnaissance in the event of radiological and nuclear (RN) incidents or attacks is vital to launch an appropriate response. This need is made stronger by the increasing threat of RN attacks on soft targets and critical infrastruc
Externí odkaz:
https://doaj.org/article/aa97101146c04027a74a3c0b0ab393c5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 22-35 (2019)
Domain-specific heuristics are an important technique for solving combinatorial problems efficiently. We propose a novel semantics for declarative specifications of domain-specific heuristics in Answer Set Programming (ASP). Decision procedures that
Externí odkaz:
https://doaj.org/article/8cfe04ca5cb0402584e8e4ee940491b6