Parametric quantified SAT solving

Sturm, Thomas; Zengler, Christoph

doi:10.1145/1837934.1837954

Cited by 3 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This rather naive approach to propositional reasoning turns out surprisingly strong when combined with a propositional variant of the deep simplification. For certain QBF benchmarks this combination turned out even superior to adaptions of context-driven clause learning (CDCL) to QBF [64]. There is an implementation in Redlog [49].…”

Section: Other Domainsmentioning

confidence: 99%

Thirty Years of Virtual Substitution

Sturm

2018

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation

Self Cite

View full text Add to dashboard Cite

In 1988, Weispfenning published a seminal paper introducing a substitution technique for quantifier elimination in the linear theories of ordered and valued fields. The original focus was on complexity bounds including the important result that the decision problem for Tarski Algebra is bounded from below by a double exponential function. Soon after, Weispfenning's group began to implement substitution techniques in software in order to study their potential applicability to real world problems. Today virtual substitution has become an established computational tool, which greatly complements cylindrical algebraic decomposition. There are powerful implementations and applications with a current focus on satisfiability modulo theory solving and qualitative analysis of biological networks. CCS CONCEPTS • Computing methodologies → Equation and inequality solving algorithms; Algebraic algorithms;

show abstract

Section: Other Domainsmentioning

confidence: 99%

Thirty Years of Virtual Substitution

Sturm

2018

Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Although we are focusing on the reals here, it is noteworthy that extended quantifier elimination is an established concept, which exists also for a variety of other important algebraic theories including the linear theory of valued fields (Sturm, 2000b), Presburger Arithmetic (Lasaruk and Sturm, 2007), initial Boolean algebras (Seidl and Sturm, 2003;Sturm and Zengler, 2010), and certain term algebras (Sturm and Weispfenning, 2002).…”

Section: The Concept Of Extended Quantifier Eliminationmentioning

confidence: 99%

Better answers to real questions

Košta

Sturm

Dolzmann

2016

Journal of Symbolic Computation

Self Cite

View full text Add to dashboard Cite

The lack of access to visual information like text labels, icons, and colors can cause frustration and decrease independence for blind people. Current access technology uses automatic approaches to address some problems in this space, but the technology is error-prone, limited in scope, and quite expensive. In this paper, we introduce VizWiz, a talking application for mobile phones that offers a new alternative to answering visual questions in nearly real-time-asking multiple people on the web. To support answering questions quickly, we introduce a general approach for intelligently recruiting human workers in advance called quikTurkit so that workers are available when new questions arrive. A field deployment with 11 blind participants illustrates that blind people can effectively use VizWiz to cheaply answer questions in their everyday lives, highlighting issues that automatic approaches will need to address to be useful. Finally, we illustrate the potential of using VizWiz as part of the participatory design of advanced tools by using it to build and evaluate VizWiz::LocateIt, an interactive mobile tool that helps blind people solve general visual search problems.

show abstract

Boolean Quantifier Elimination for Automotive Configuration – A Case Study

Zengler

Küchlin

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Parametric quantified SAT solving

Cited by 3 publications

References 17 publications

Thirty Years of Virtual Substitution

Thirty Years of Virtual Substitution

Better answers to real questions

Boolean Quantifier Elimination for Automotive Configuration – A Case Study

Contact Info

Product

Resources

About