BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × China
1 × Denmark
1 × Finland
1 × France
1 × Germany
1 × United Kingdom
2 × Czech Republic
3 × USA
4 × Italy
Collaborated with:
∅ F.Lonsing S.Woltran N.Creignou M.Seidl T.Rath H.Daudé R.Rossignol S.Schmitt H.Tompits A.V.Gelder S.A.Gaggl R.Pichler M.Widl P.Brosch G.Kappel W.Bibel S.Brüning M.Zolda A.Biere M.Heule S.Gabmeyer M.Wimmer
Talks about:
formula (4) qbf (4) quantifi (3) boolean (3) framework (2) translat (2) transit (2) program (2) diagram (2) system (2)

Person: Uwe Egly

DBLP DBLP: Egly:Uwe

Facilitated 1 volumes:

SAT 2014Ed

Contributed to:

SAT 20152015
SAT 20132013
SAT 20122012
SLE 20122012
TAP 20122012
SAT 20092009
ICLP 20082008
SAT 20082008
SAT 20032003
CADE 20022002
SAT 20022002
IJCAR 20012001
CSL 19981998
CADE 19971997
CADE 19961996
CADE 19941994
CADE 20172017
IJCAR 20182018

Wrote 19 papers:

SAT-2015-LonsingE #api #incremental #satisfiability
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (FL, UE), pp. 191–198.
SAT-2013-LonsingEG #learning #performance #pseudo #quantifier
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (FL, UE, AVG), pp. 100–115.
SAT-2012-Egly #on the
On Sequent Systems and Resolution for QBFs (UE), pp. 100–113.
SLE-2012-WidlBBEHKST #diagrams #sequence chart
Guided Merging of Sequence Diagrams (MW, AB, PB, UE, MH, GK, MS, HT), pp. 164–183.
TAP-2012-BroschEGKSTWW #diagrams #testing #towards #uml
Towards Scenario-Based Testing of UML Diagrams (PB, UE, SG, GK, MS, HT, MW, MW), pp. 149–155.
TAP-2012-CreignouES #framework #random #satisfiability #specification
A Framework for the Specification of Random SAT and QSAT Formulas (NC, UE, MS), pp. 163–168.
SAT-2009-CreignouDER #comprehension
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms (NC, HD, UE, RR), pp. 363–376.
ICLP-2008-EglyGW #framework #implementation #named #programming #using
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming (UE, SAG, SW), pp. 734–738.
SAT-2008-CreignouDER #quantifier #random
New Results on the Phase Transition for Random Quantified Boolean Formulas (NC, HD, UE, RR), pp. 34–47.
SAT-2003-EglySTWZ #quantifier
Comparing Different Prenexing Strategies for Quantified Boolean Formulas (UE, MS, HT, SW, MZ), pp. 214–228.
CADE-2002-Egly #logic
Embedding Lax Logic into Intuitionistic Logic (UE), pp. 78–93.
SAT-2002-EglyWP #on the #problem
On deciding subsumption problems (UE, SW, RP), p. 36.
IJCAR-2001-EglyS #composition #proving #source code
Deriving Modular Programs from Short Proofs (UE, SS), pp. 561–577.
CSL-1998-Egly
Quantifers and the System KE: Some Surprising Results (UE), pp. 90–104.
CADE-1997-Egly #how
Some Pitfalls of LK-to-LJ Translations and How to Avoid Them (UE), pp. 116–130.
CADE-1996-EglyR #normalisation #on the
On the Practical Value of Different Definitional Translations to Normal Form (UE, TR), pp. 403–417.
CADE-1994-BibelBER
KoMeT (WB, SB, UE, TR), pp. 783–787.
CADE-2017-LonsingE #search-based
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL (FL, UE), pp. 371–384.
IJCAR-2018-LonsingE
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property (FL, UE), pp. 161–177.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.