MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Hans Tompits" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 58 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Expressing Default Abduction Problems as Quantified Boolean Formulas  
  • by Hans Tompits — 2002 — AI Communications
  • …Abduction is the process of finding explanations for observed phenomena in accord to known laws about a given application domain. This form of reasoning is an important principle of common-sense reasoning and is particularly relevant in conjunction with nonmonotonic knowledge representation formalis…
  • Cited by 2 (2 self) – Add To MetaCart
  • Non-Elementary Speed-Ups in Default Reasoning  
  • by Uwe Egly, Hans Tompits — 1997 — Proceedings ECSQARU'97
  • …. Default logic is one of the most prominent formalizations of common-sense reasoning. It allows "jumping to conclusions" in case that not all relevant information is known. However, theoretical complexity results imply that default logic is (in the worst case) computationally harder than classical …
  • Cited by 2 (2 self) – Add To MetaCart
  • Is Nonmonotonic Reasoning Always Harder?  
  • by Uwe Egly, Hans Tompits — Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Fachberichte Informatik 18--96, Universit at Koblenz-Landau, Institut fur Informatik, Rheinau 1, D-56075
  • …. Although it has been shown that the worst-case complexity of the usual reasoning tasks in the context of nonmonotonic reasoning is presumably harder than the worst-case complexity of the relevant decision problems in classical logic, there are cases where a nonmonotonic treatment actually simplifi…
  • Cited by 1 (1 self) – Add To MetaCart
  • Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming  
  • by Hans Tompits, Stefan Woltran — 2005 — in Answer-Set Programming’, in Proc. ICLP’05
  • …Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different notions of equivalence, including the well-known notions of strong and uniform equivalence, as well as refined equivalence no…
  • 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
  • …Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quan…
  • Add To MetaCart
  • A Generic Approach for Knowledge-Based Information-Site Selection  
  • by Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits — 2002 — In KR-02
  • …With the advent of the World Wide Web, a vast number of heterogenous information sources has become available. In order to access and process these data, suitable tools and methods for building an information infrastructure are necessary. One task for this purpose is the selection of relevant …
  • Cited by 10 (1 self) – 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
  • …Abstract. Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translat…
  • 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
  • …Modal nonmonotonic logics constitute a well-known family of knowledge -representation formalisms capturing ideally rational agents reasoning about their own beliefs. Although these formalisms are extensively studied from a theoretical point of view, most of these approaches lack generally availab…
  • Cited by 8 (7 self) – Add To MetaCart
  • H.: DLV-HEX: Dealing with Semantic Web under Answer-Set Programming  
  • by Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits — 2005 — In: The Proceedings of the 4th International Semantic Web Conference
  • …We present an implementation of HEX programs, which are nonmonotonic logic programs admitting higher-order atoms as well as external atoms. Higher-order features are widely acknowledged as useful for various tasks, including meta-reasoning. Furthermore, the possibility to exchange knowledge with ext…
  • Cited by 1 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB