MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Stefan Woltran" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

30 documents found, showing 1 through 10. Next 10 →

ATOM

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
by Hans Tompits, Stefan Woltran — 2005 — in Answer-Set Programming’, in Proc. ICLP’05
… and Stefan Woltran ⋆ Institut für Informationssysteme 184/3,Technische Universität Wien, Favoritenstraße 9…
Cited by 6 (3 self) – Add To MetaCart

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
by Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran — 2002 — In Proc. JELIA’02, volume 2424 of LNCS
… ⋆ Philippe Besnard 1 , Torsten Schaub 1 , Hans Tompits 2 , and Stefan Woltran 2 1 Institut für Informatik…
Add To MetaCart

Paraconsistent reasoning via quantified Boolean formulas, I: Axiomatising signed systems
by Torsten Schaub, Hans Tompits, Stefan Woltran — 2002 — In Proc. JELIA’02, volume 2424 of LNCS
… ⋆ Philippe Besnard 1 , Torsten Schaub 2⋆⋆ , Hans Tompits 3 , and Stefan Woltran 3 1 IRIT-CNRS, 118, route de…
Cited by 5 (2 self) – Add To MetaCart

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
by Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran — 2002 — In Proceedings of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX2002
… Eiter, Volker Klotz, Hans Tompits, and Stefan Woltran Institut fur Informationssysteme 184…
Cited by 8 (7 self) – Add To MetaCart

Strong and uniform equivalence in answer-set programming: Characterizations and complexity results for the non-ground case
by Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran — 2005 — In Proc. AAAI 2005
… for the Non-Ground Case ∗ Thomas Eiter, Michael Fink, Hans Tompits, and Stefan Woltran Institut für…
Cited by 8 (8 self) – Add To MetaCart

On Solution Correspondences in Answer Set Programming
by Thomas Eiter, Hans Tompits, Stefan Woltran — 2005 — In Proc. of 19th International Joint Conference on Artificial Intelligence, 97–102
…On Solution Correspondences in Answer-Set Programming ∗ Thomas Eiter, Hans Tompits, and Stefan…
Cited by 9 (6 self) – Add To MetaCart

Some questions for institutions to consider further in their own context • To what extent are current or developing institutional strategies for learning and teaching seen to incorporate the underlying principles of ‘information literacy’ among their stud
by Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran — 1989 — In Proc. NMR’06
… Results ⋆ Johannes Oetsch, Martina Seidl, Hans Tompits, and Stefan Woltran Institut für…
Cited by 1 (1 self) – Add To MetaCart

Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
by Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran — 2003 — In Proc. ASP-03. Available at: http://CEUR-WS.org/Vol-78
… Eiter, Michael Fink, Hans Tompits, and Stefan Woltran Institut für Informationssysteme 184/3, Technische…
Cited by 2 (2 self) – Add To MetaCart

cc⊤: A correspondencechecking tool for logic programs under the answer-set semantics
by Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran — In Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA 2006
… Oetsch 1 , Martina Seidl 2 , Hans Tompits 1 , and Stefan Woltran 1 1 Institut für Informationssysteme 184…
Cited by 1 (1 self) – Add To MetaCart

Simplifying logic programs under uniform and strong equivalence
by Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran — 2004 — In LPNMR’04
… and Strong Equivalence ⋆ Thomas Eiter, Michael Fink, Hans Tompits, and Stefan Woltran Institut für…
Cited by 22 (10 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB