4,984 Hits in 2.5 sec

Duality in STRIPS planning [article]

Martin Suda
2013 arXiv   pre-print
We describe a duality mapping between STRIPS planning tasks. By exchanging the initial and goal conditions, taking their respective complements, and swapping for every action its precondition and delete list, one obtains for every STRIPS task its dual version, which has a solution if and only if the original does. This is proved by showing that the described transformation essentially turns progression (forward search) into regression (backward search) and vice versa. The duality sheds new
more » ... on STRIPS planning by allowing a transfer of ideas from one search approach to the other. It can be used to construct new algorithms from old ones, or (equivalently) to obtain new benchmarks from existing ones. Experiments show that the dual versions of IPC benchmarks are in general quite difficult for modern planners. This may be seen as a new challenge. On the other hand, the cases where the dual versions are easier to solve demonstrate that the duality can also be made useful in practice.
arXiv:1304.0897v1 fatcat:dp2hj44osngbpbjfeao2wuhiiq

Triggered Clause Pushing for IC3 [article]

Martin Suda
2013 arXiv   pre-print
Available at ∼ suda/triggered.html. Due to space limitations, some aspects of the algorithm could not be presented in full detail.  ... 
arXiv:1307.4966v1 fatcat:v63ipphuwncrbd2wuadektgxye

Splitting Proofs for Interpolation [article]

Bernhard Gleiss, Laura Kovacs, Martin Suda
2017 arXiv   pre-print
This is because SEOpt cannot 6 The executables and connecting scripts used in the experiment are available at http:// 7 SEOpt uses the SMT  ... 
arXiv:1711.02503v1 fatcat:ae4ltmfy55hhnfxhspjisurbsi

Selecting the Selection [article]

Giles Reger, Martin Suda, Andrei Voronkov, Krystof Hoder
2016 arXiv   pre-print
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for reasoning about first-order logic with or without equality. Practical implementations of this calculus use a variety of literal selections and term orderings to tame the growth of the search space and help steer proof search. This paper introduces the notion of lookahead selection that estimates (looks ahead) the effect on the search space of selecting a literal. There is also a case made for
more » ... use of incomplete selection functions that attempt to restrict the search space instead of satisfying some completeness criteria. Experimental evaluation in the \Vampire\ theorem prover shows that both lookahead selection and incomplete selection significantly contribute to solving hard problems unsolvable by other methods.
arXiv:1604.08055v1 fatcat:faa3oyfbzndkdcf4sjz5ry2xci

Learning Precedences from Simple Symbol Features

Filip Bartek, Martin Suda
2020 Zenodo  
A simplification ordering, typically specified by a symbol precedence, is one of the key parameters of the superposition calculus, contributing to shaping the search space navigated by a saturation-based automated theorem prover. Thus the choice of a precedence can have a great impact on the prover's performance. In this work, we design a system for proposing symbol precedences that should lead to solving a problem quickly. The system relies on machine learning to extract this information from
more » ... ast successful and unsuccessful runs of a theorem prover over a set of problems and randomly sampled precedences. It uses a small set of simple human-engineered symbol features as the sole basis for discriminating the symbols. This allows for a direct comparison with precedence generation schemes designed by prover developers.
doi:10.5281/zenodo.4584793 fatcat:r2xbwhcatre65eepjgjqmha2gi

Lifting QBF Resolution Calculi to DQBF [article]

Olaf Beyersdorff, Leroy Chew, Renate Schmidt, Martin Suda
2016 arXiv   pre-print
Martin Suda was supported by the EPSRC grant EP/K032674/1 and the ERC Starting Grant 2014 SYMCAR 639270.  ... 
arXiv:1604.08058v1 fatcat:teegsoixgzd53mbdzoqrd4qk6m

Blocked Clauses in First-Order Logic [article]

Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere
2017 arXiv   pre-print
Blocked clauses provide the basis for powerful reasoning techniques used in SAT, QBF, and DQBF solving. Their definition, which relies on a simple syntactic criterion, guarantees that they are both redundant and easy to find. In this paper, we lift the notion of blocked clauses to first-order logic. We introduce two types of blocked clauses, one for first-order logic with equality and the other for first-order logic without equality, and prove their redundancy. In addition, we give a polynomial
more » ... algorithm for checking whether a clause is blocked. Based on our new notions of blocking, we implemented a novel first-order preprocessing tool. Our experiments showed that many first-order problems in the TPTP library contain a large number of blocked clauses. Moreover, we observed that their elimination can improve the performance of modern theorem provers, especially on satisfiable problem instances.
arXiv:1702.00847v1 fatcat:kwzzzo36bvamdiqblrf3a2bhdq

A Novel Attack Strategy on Entanglement Swapping QKD Protocols [article]

Stefan Schauer, Martin Suda
2008 arXiv   pre-print
Li et al. presented a protocol [Int. Journal of Quantum Information, Vol. 4, No. 6 (2006) 899-906] for quantum key distribution based on entanglement swapping. In this protocol they use random and certain bits to construct a classical key and they claim that this key is secure. In our article we show that the protocol by Li et al. is insecure presenting a new type of attack strategy which gives an adversary full information about the key without being detected. This strategy is based on
more » ... ment swapping, too, and manages to preserve the correlation between the measurement results of the legitimate parties. Further we present a modified version of the protocol and show that it is secure against this new attack strategy.
arXiv:0805.4322v1 fatcat:4cu3kwo53jd5lcpwx5j3hjgl24

Layered Clause Selection for Saturation-based Theorem Proving

Bernhard Gleiss, Martin Suda
2020 Zenodo  
Clause selection is one of the main heuristic decision points in navigating proof search of saturation-based theorem provers. A recently developed layered clause selection framework allows one to boost a basic clause selection heuristic by organising clauses into groups of more or less promising ones according to a specified numerical feature. In this work, we investigate this framework in depth and introduce, in addition to a previously presented feature (based on the amount of theory
more » ... in the derivation of a clause), three new features for clause selection (tracking relatedness to the goal, the number of split dependencies in the AVATAR architecture, and closeness to the Horn fragment, respectively). We implemented the resulting clause selection heuristics in the state-of-the-art saturation-based theorem prover Vampire and present an evaluation of these new clause-selection strategies and their combinations over the TPTP and SMTLIB libraries.
doi:10.5281/zenodo.4584799 fatcat:gzosonxhsbgi3pmxeme6expmzq

Labelled Superposition for PLTL [chapter]

Martin Suda, Christoph Weidenbach
2012 Lecture Notes in Computer Science  
Publication Notes This report is an extended version of an article published elsewhere. Abstract This paper introduces a new decision procedure for PLTL based on labelled superposition. Its main idea is to treat temporal formulas as infinite sets of purely propositional clauses over an extended signature. These infinite sets are then represented by finite sets of labelled propositional clauses. The new representation enables the replacement of the complex temporal resolution rule, suggested by
more » ... xisting resolution calculi for PLTL, by a fine grained repetition check of finitely saturated labelled clause sets followed by a simple inference. The completeness argument is based on the standard model building idea from superposition. It inherently justifies ordering restrictions, redundancy elimination and effective partial model building. The latter can be directly used to effectively generate counterexamples of non-valid PLTL conjectures out of saturated labelled clause sets in a straightforward way.
doi:10.1007/978-3-642-28717-6_31 fatcat:ng6g23ux2nbsxa3s23wjo2hmpe

SAT Competition 2020

Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, Martin Suda
2021 Artificial Intelligence  
Martin Suda was supported by the European Research Council (ERC) Consolidator grant AI4REASON no. 649043 under the EU-H2020 programme, the Czech Science Foundation project 20-06390Y, and the project RICAIP  ... 
doi:10.1016/j.artint.2021.103572 fatcat:skb6htbelzdqra32lo7weyhu2u

Playing with AVATAR [chapter]

Giles Reger, Martin Suda, Andrei Voronkov
2015 Lecture Notes in Computer Science  
Modern first-order resolution and superposition theorem provers use saturation algorithms to search for a refutation in clauses derivable from the input clauses. On hard problems, this search space often grows rapidly and performance degrades especially fast when long and heavy clauses are generated. One approach that has proved successful in taming the search space is splitting where clauses are split into components with disjoint variables and the components are asserted in turn. This reduces
more » ... the length and weight of clauses in the search space at the cost of keeping track of splitting decisions. This paper considers the new AVATAR (Advanced Vampire Architecture for Theories And Resolution) approach to splitting which places a SAT (or SMT) solver at the centre of the theorem prover and uses it to direct the exploration of the search space. Using such an approach also allows the propositional part of the search space to be dealt with outside of the first-order prover. AVATAR has proved very successful, especially for problems coming from applications such as program verification and program analysis as these commonly contain clauses suitable for splitting. However, AVATAR is still a new idea and there is much left to understand. This paper presents an in-depth exploration of this new architecture, introducing new, highly experimental, options that allow us to vary the operation and interaction of the various components. It then extensively evaluates these new options, using the TPTP library, to gain an insight into which of these options are essential and how AVATAR can be optimally applied. Partially supported by the EPSRC grant "Reasoning for Verification and Security" AVATAR by Example Whilst the theory of AVATAR was established in [9] , and is reviewed later in this paper, the authors feel that the key ideas behind the approach are best demonstrated via an example.
doi:10.1007/978-3-319-21401-6_28 fatcat:qelxxzlrvbhjlmsujj6vxbewwu

Finding Finite Models in Multi-Sorted First Order Logic [article]

Giles Reger, Martin Suda, Andrei Voronkov
2016 arXiv   pre-print
Martin Suda and Andrei Voroknov were partially supported by ERC Starting Grant 2014 SYMCAR 639270. Andrei Voronkov was also partially supported by the Wallenberg Academy Fellowship 2014 -TheProSE.  ... 
arXiv:1604.08040v1 fatcat:3mwe45k45fb5lefbu53sfouupi

Modulation of Osteoclast Differentiation

1992 Endocrine reviews  
Martin TJ, Suda T 1988 Induction of calcitonin receptors by lol,25-dihydroxyvitamin D, in osteoclast-like multinucleated cells formed from mouse bone marrow cells.  ...  Suda, in preparation) . Further addition of conditioned medium from L-929 cell cultures as a source of mouse M-CSF reversed the inhibition.  ... 
doi:10.1210/edrv-13-1-66 pmid:1555533 fatcat:ctsienz2yzdbvnppdo7unb2dh4

Conjugate Variables as a Resource in Signal and Image Processing [article]

Michael Nölle, Martin Suda
2011 arXiv   pre-print
In this paper we develop a new technique to model joint distributions of signals. Our technique is based on quantum mechanical conjugate variables. We show that the transition probability of quantum states leads to a distance function on the signals. This distance function obeys the triangle inequality on all quantum states and becomes a metric on pure quantum states. Treating signals as conjugate variables allows us to create a new approach to segment them. Keywords: Quantum information,
more » ... tion probability, Euclidean distance, Fubini-study metric, Bhattacharyya coefficients, conjugate variable, signal/sensor fusion, signal and image segmentation.
arXiv:1108.5720v1 fatcat:vs2gdlyc3ra7lobqm2je4snywq
« Previous Showing results 1 — 15 out of 4,984 results