Order:
  1.  12
    Combining answer set programming with description logics for the Semantic Web.Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer & Hans Tompits - 2008 - Artificial Intelligence 172 (12-13):1495-1539.
  2.  10
    Sequent-type rejection systems for finite-valued non-deterministic logics.Martin Gius & Hans Tompits - 2023 - Journal of Applied Non-Classical Logics 33 (3):606-640.
    A rejection system, also referred to as a complementary calculus, is a proof system axiomatising the invalid formulas of a logic, in contrast to traditional calculi which axiomatise the valid ones. Rejection systems therefore introduce a purely syntactic way of determining non-validity without having to consider countermodels, which can be useful in procedures for automated deduction and proof search. Rejection calculi have first been formally introduced by Łukasiewicz in the context of Aristotelian syllogistic and subsequently rejection systems for many well-known (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  8
    Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.
    As is well known, answer-set programs do not satisfy the replacement property in general, i.e., programs and that are equivalent may cease to be so when they are put in the context of some other program, i.e., and may have different answer sets. Lifschitz, Pearce, and Valverde thus introduced strong equivalence for context-independent equivalence, and proved that such equivalence holds between given programs and iff and are equivalent theories in the monotonic logic of here-and-there. In this article, we consider a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  29
    A many-sorted variant of Japaridze’s polymodal provability logic.Gerald Berger, Lev D. Beklemishev & Hans Tompits - 2018 - Logic Journal of the IGPL 26 (5):505-538.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  6
    On different proof-search strategies for orthologic.Uwe Egly & Hans Tompits - 2003 - Studia Logica 73 (1):131 - 152.
    In this paper, we consider three different search strategies for a cut-free sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential. In a combined forward and backward approach, all proofs are polynomial, but the potential search space remains exponential. Using a forward strategy, the potential search space becomes polynomial yielding a polynomial decision procedure for orthologic and the word (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  6.  4
    On Different Proof-Search Strategies for Orthologic.Uwe Egly & Hans Tompits - 2003 - Studia Logica 73 (1):131-152.
    In this paper, we consider three different search strategies for a cut-free sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential. In a combined forward and backward approach, all proofs are polynomial, but the potential search space remains exponential. Using a forward strategy, the potential search space becomes polynomial yielding a polynomial decision procedure for orthologic and the word (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  5
    16th Workshop on Logic, Language, Information and Computation (WoLLIC 2009).Hans Tompits, Ken Satoh, Arnold Beckmann, Carlos Caleiro, Thomas Eiter, Sylvain Salvati, Taisuke Sato & Frank Wolter - 2010 - Bulletin of Symbolic Logic 16 (1):805-815.