BibSLEIGH — Hans

Travelled to:

1 × Australia
1 × Canada
1 × Czech Republic
1 × Denmark
1 × Germany
1 × Hungary
1 × Ireland
1 × Spain
1 × USA
1 × United Kingdom
2 × France
3 × Italy

Collaborated with:

S.Woltran J.Oetsch J.Pührer T.Eiter T.Schaub J.P.Delgrande M.Seidl M.Fink B.Kiesl M.Schwengerer U.Egly A.Biere P.Schüller J.d.Bruijn W.Faber T.Linke M.Widl P.Brosch G.Kappel T.Lukasiewicz R.Schindlauer G.Sabbatini P.Busoniu P.Skocovsky M.D.Vos D.G.Kisa M.Prischink P.Traxler M.Zolda D.Pearce V.Sarsakov M.Heule S.Gabmeyer M.Wimmer

Talks about:

program (20) answer (15) set (15) logic (9) disjunct (5) semant (5) ground (4) under (4) non (4) base (3)

Person: Hans Tompits

DBLP: Tompits:Hans

Contributed to:

2015

2013

2012

2010

2009

2008

2006

2005

2004

2003

2002

2016

Wrote 26 papers:

ICLP-2015-KieslST #analysis #on the #source code: On Structural Analysis of Non-Ground Answer-Set Programs (BK, PS, HT), pp. 221–234.
ICLP-J-2013-BusoniuOPST #debugging #ide #named #programming: SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support (PAB, JO, JP, PS, HT), pp. 657–673.
ICLP-2012-OetschPT #constraints #semantics #source code: An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions (JO, JP, HT), pp. 222–234.
ICLP-J-2012-VosKOPT #source code: Annotating answer-set programs in Lana (MDV, DGK, JO, JP, HT), pp. 619–637.
KR-2012-OetschPPST #on the #source code #testing: On the Small-Scope Hypothesis for Testing Answer-Set Programs (JO, MP, JP, MS, HT).
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.
ICLP-2010-OetschPT10 #source code: Methods and Methodologies for Developing Answer-Set Programs — Project Description (JO, JP, HT), pp. 154–161.
ICLP-J-2010-OetschPST #detection #source code: The system Kato: Detecting cases of plagiarism for answer-set programs (JO, JP, MS, HT), pp. 759–775.
ICLP-J-2010-OetschPT #debugging #source code: Catching the Ouroboros: On debugging non-ground answer-set programs (JO, JP, HT), pp. 513–529.
ICLP-2009-DelgrandeSTW #logic programming #semantics #set #source code: Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
ICLP-2008-OetschT #semantics: Program Correspondence under the Answer-Set Semantics: The Non-ground Case (JO, HT), pp. 591–605.
ICLP-2008-PuhrerTW #source code: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.
KR-2008-BruijnET #logic #ontology: Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic (JdB, TE, HT), pp. 485–495.
KR-2008-DelgrandeSTW #logic programming #semantics #set #source code: Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KR-2008-FaberTW #equivalence #logic programming #order #source code: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
KR-2006-EiterFTTW #programming: Replacements in Non-Ground Answer-Set Programming (TE, MF, HT, PT, SW), pp. 340–351.
ICLP-2005-TompitsW #equivalence #implementation #programming #towards: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming (HT, SW), pp. 189–203.
ICLP-2004-LinkeTW #logic programming #on the #source code: On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.
KR-2004-DelgrandeST #reasoning: Domain-Specific Preferences for Causal Reasoning and Planning (JPD, TS, HT), pp. 673–682.
KR-2004-EiterFTW #logic programming #on the: On Eliminating Disjunctions in Stable Logic Programming (TE, MF, HT, SW), pp. 447–458.
KR-2004-EiterLST #logic #programming #semantics #set #web: Combining Answer Set Programming with Description Logics for the Semantic Web (TE, TL, RS, HT), pp. 141–151.
SAT-2003-EglySTWZ #quantifier: Comparing Different Prenexing Strategies for Quantified Boolean Formulas (UE, MS, HT, SW, MZ), pp. 214–228.
ICLP-2002-PearceSSTW #logic programming #polynomial #source code: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report (DP, VS, TS, HT, SW), pp. 405–420.
KR-2002-EiterFST #approach #knowledge-based: A Generic Approach for Knowledge-Based Information-Site Selection (TE, MF, GS, HT), pp. 459–469.
IJCAR-2016-KieslSTB: Super-Blocked Clauses (BK, MS, HT, AB), pp. 45–61.