#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2008

2017

- This year (6)
- Last 5 years (23)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Martin Suda
- ICAPS
- 2014

Property Directed Reachability (PDR) is a very promising recent method for deciding reachability in symbolically represented transition systems. While originally conceived as a model checking algorithm for hardware circuits, it has already been successfully applied in several other areas. This paper is the first investigation of PDR from the perspective of… (More)

- Martin Suda, Christoph Weidenbach
- IJCAR
- 2012

- Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda
- Electronic Colloquium on Computational Complexity
- 2016

We examine existing resolution systems for quantified Boolean formulas (QBF) and answer the question which of these calculi can be lifted to the more powerful Dependency QBFs (DQBF). An interesting picture emerges: While for QBF we have the strict chain of proof systems Q-Res < IR-calc < IRM-calc, the situation is quite different in DQBF. The obvious… (More)

- Giles Reger, Martin Suda, Andrei Voronkov
- CADE
- 2015

- Martin Suda, Christoph Weidenbach, Patrick Wischnewski
- IJCAR
- 2010

- Martin Suda, Christoph Weidenbach
- LPAR
- 2012

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… (More)

- Krystof Hoder, Giles Reger, Martin Suda, Andrei Voronkov
- IJCAR
- 2016

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… (More)

In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as normal internal axioms. This work addresses the issues of accessing external sources of axioms from a first-order logic ATP system, and presents an implemented ATP system that retrieves… (More)

- Geoff Sutcliffe, Martin Suda, Alexandra Teyssandier, Nelson Dellis, Gerard de Melo
- FLAIRS Conference
- 2010

There is a growing demand for automated reasoning with world knowledge. SPASS-XDB is an automated reasoning system that incorporates world knowledge from multiple external sources, asynchronously on demand, during its reasoning process. This paper describes how SPASS-XDB’s reasoning is focussed and controlled, its sources of world knowledge, and their use… (More)