Filters








444 Hits in 4.2 sec

Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning

Jendrik Seipp, Malte Helmert
2018 The Journal of Artificial Intelligence Research  
Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally computing abstractions of transition systems.  ...  We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning.  ...  Experiments We implemented our counterexample-guided Cartesian abstraction refinement and saturated cost partitioning algorithms in the Fast Downward planning system (Helmert, 2006) .  ... 
doi:10.1613/jair.1.11217 fatcat:gjrouhtxxzewnd2f6tfor2bmri

Counterexample-guided cartesian abstraction refinement and saturated cost partitioning for optimal classical planning

Jörg Hoffmann, Malte Helmert, Jendrik Seipp
2018 unpublished
We introduce a new family of admissible heuristics for classical planning, based on Cartesian abstractions, which we derive by counterexample-guided abstraction refinement.  ...  Contributions This thesis makes the following key contributions: • In Chapter 4, we adapt counterexample-guided abstraction refinement from the model checking to the classical planning setting.  ... 
doi:10.5451/unibas-006809155 fatcat:qqljloe3gvfqvaxujge74gxw5e

Towards Abstraction in ASP with an Application on Reasoning about Agent Policies [article]

Zeynep G. Saribatur, Thomas Eiter
2018 arXiv   pre-print
We consider abstraction as a means of over-approximation and introduce a method to automatically abstract (possibly non-ground) ASP programs that preserves their structure, while reducing the size of the  ...  ASP programs are a convenient tool for problem solving, whereas with large problem instances the size of the state space can be prohibitive.  ...  Cartesian abstraction (Seipp and Helmert 2013) refines in the spirit of (Clarke et al. 2003 ) failure states of abstract trajectories, starting from a trivial abstraction; the classical planning setting  ... 
arXiv:1809.06638v1 fatcat:w25ruelwqbfspdk5gptlw7nuge

An abstraction refinement approach combining precise and approximated techniques

Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich
2011 International Journal on Software Tools for Technology Transfer (STTT)  
The refinement loop can become prohibitively expensive for large programs.  ...  However, approximation results in a higher number of refinement iterations, since it can produce more false counterexamples than its precise counterpart.  ...  Introduction Predicate abstraction [16, 20] , when combined with reachability analysis and an automated abstraction refinement mechanism (also known as Counterexample Guided Abstraction Refinement (CEGAR  ... 
doi:10.1007/s10009-011-0185-y fatcat:g2gpjrlvvja3zpy6uywqdwh7mi

ProB: an automated analysis toolset for the B method

Michael Leuschel, Michael Butler
2008 International Journal on Software Tools for Technology Transfer (STTT)  
ProB also contains a model checker and a refinement checker, both of which can be used to detect various errors in B specifications.  ...  We present ProB, a validation toolset for the B method. ProB's automated animation facilities allow users to gain confidence in their specifications.  ...  In future work we plan to enable this on-the-fly expansion also for the abstract state space. The second implementation has been done in XSB Prolog.  ... 
doi:10.1007/s10009-007-0063-9 fatcat:vdtr752dhva5tpm6xkc43nw5be

Compositional abstraction refinement for control synthesis

Pierre-Jean Meyer, Dimos V. Dimarogonas
2018 Nonlinear Analysis. Hybrid Systems  
This paper presents a compositional approach to specification-guided abstraction refinement for control synthesis of a nonlinear system associated with a method to over-approximate its reachable sets.  ...  A finite abstraction is created for each subsystem through a refinement procedure starting from a coarse partition of the state space, then proceeding backwards on the specification sequence to iteratively  ...  The most popular approach is called CounterExample-Guided Abstraction Refinement (CEGAR) and consists in exploiting the counterexample provided by the model checker when the abstraction does not satisfy  ... 
doi:10.1016/j.nahs.2017.10.006 fatcat:tuxjur5ngbcqzb64nk6hict2n4

Reasoning about Representations in Autonomous Systems: What Pólya and Lakatos Have to Say [chapter]

Alan Bundy
2012 The Complex Mind  
The advantages of weakening are obvious; this is the classic abstraction approach, whereby a simpler conjecture is formulated and proved, then its proof is used to guide the proof of the original conjecture  ...  George Pólya has written the classic guide to the art of problem solving [Pólya, 1945] .  ... 
doi:10.1057/9780230354456_9 fatcat:fckitbcckrclfaw7avumog337q

Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning

Maximilian Fickert, Jörg Hoffmann
2022 The Journal of Artificial Intelligence Research  
In classical AI planning, heuristic functions typically base their estimates on a relaxation of the input task.  ...  Traditionally, such refinement is performed offline to instantiate the heuristic for the search.  ...  This paper adds several extensions, including a novel online-refinement hill-climbing algorithm leveraging subgoal counting in its local lookahead search, and analyzes the algorithms and results in much  ... 
doi:10.1613/jair.1.13153 fatcat:x7evijmkk5fy5npgpchz5lel7a

Abstraction for non-ground answer set programs

Zeynep G. Saribatur, Thomas Eiter, Peter Schüller
2021 Artificial Intelligence  
Furthermore, the seminal counterexample guided abstraction refinement (CEGAR) method [25] allows for automatic generation of such abstractions, by starting from an initial abstraction that over-approximates  ...  This approach was used in planning for speeding up the solving [64] and especially for computing heuristic functions to guide the plan search in the state space.  ...  Acknowledgements We are grateful to the reviewers for their helpful and constructive comments to improve this work and its presentation.  ... 
doi:10.1016/j.artint.2021.103563 fatcat:nyhzwgry3vc4tbwaci6g2aoqay

Maximal specification synthesis

Aws Albarghouthi, Isil Dillig, Arie Gurfinkel
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
To solve this problem, we present a novel approach that utilizes a counterexample-guided inductive synthesis loop and reduces the maximal specification inference problem to multi-abduction.  ...  We formulate the novel notion of multi-abduction as a generalization of classical logical abduction and present an algorithm for solving multi-abduction problems.  ...  Acknowledgements We would like to thank Kenneth McMillan for one of the examples, and Zachary Kincaid, Thomas Reps, and Ben Liblit for comments on an early draft of the paper.  ... 
doi:10.1145/2837614.2837628 dblp:conf/popl/AlbarghouthiDG16 fatcat:5fzfvkyujrbvbpugk4jzb6hdnq

Effective Domain-Specific Formal Verification Techniques

Ákos Hajdu, Zoltán Micskei
2020 Zenodo  
We propose various efficient strategies for both abstraction and refinement. For abstraction, we extend the [...]  ...  We study abstraction-refinement-based model checking where efficiency is still a significant limitation due to the complexity of the programs and the rich domains of their variables.  ...  Counterexample-Guided Abstraction Refinement (CEGAR) Counterexample-Guided Abstraction Refinement (CEGAR) [Cla+03] is a verification algorithm that automatically constructs and refines abstractions for  ... 
doi:10.5281/zenodo.3892347 fatcat:56hta7rkh5dinlehzrcfapumme

Counterexample-guided Cartesian abstraction refinement

Jendrik Seipp, Malte Helmert
2013
Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally computing abstractions of transition systems.  ...  We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning.  ...  Heuristics for Planning and Combinatorial Search" (AHPACS).  ... 
doi:10.5451/unibas-ep32748 fatcat:crblteqaircsdchqlhbtf7jw6m

Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning

Jendrik Seipp
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
Pattern databases are the foundation of some of the strongest admissible heuristics for optimal classical planning.  ...  Acknowledgments We thank the anonymous reviewers for their helpful comments.  ...  We have received funding for this work from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement no. 817639).  ... 
doi:10.24963/ijcai.2019/780 dblp:conf/ijcai/Seipp19 fatcat:soprz2fmufhx3eafxg25nvfkg4

Additive counterexample-guided Cartesian abstraction refinement

Jendrik Seipp, Malte Helmert
2013
We recently showed how counterexample-guided abstraction refinement can be used to derive informative heuristics for optimal classical planning.  ...  In this work we introduce an algorithm for building additive abstractions and demonstrate that they outperform other state-of-the-art abstraction heuristics on many benchmark domains.  ...  Acknowledgments The Swiss National Science Foundation (SNSF) supported this work as part of the project "Abstraction Heuristics for Planning and Combinatorial Search" (AHPACS).  ... 
doi:10.5451/unibas-ep37087 fatcat:pvkml4mlbjdgrjpim33hq3dcb4

Compositional abstraction refinement for control synthesis under lasso-shaped specifications

Pierre-Jean Meyer, Dimos V. Dimarogonas
2017 2017 American Control Conference (ACC)  
This paper presents a compositional approach to specification-guided abstraction refinement for control synthesis of a nonlinear system associated with a method to overapproximate its reachable sets.  ...  A finite abstraction is created for each subsystem through a refinement procedure, which starts from a coarse partition of the state space and then proceeds backwards on the lasso sequence to iteratively  ...  [16] , [23] , [17] , with the most popular approach being based on CounterExample-Guided Abstraction Refinement (CEGAR) [8] , [4] , [3] , [12] .  ... 
doi:10.23919/acc.2017.7963006 dblp:conf/amcc/MeyerD17 fatcat:ynwxdm5zjnbaxoapdpeedoou4a
« Previous Showing results 1 — 15 out of 444 results