134 search results - page 7 / 27 » Argumentation-based Ranking Logics |
CALCO
2011
Springer
12 years 9 months ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
FOSSACS
2006
Springer
14 years 1 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
SIGIR
1999
ACM
14 years 2 months ago
1999
ACM
This paper claims that Belief Revision can be seen as a theoretical framework for document ranking in Extended Boolean Models. For a model of Information Retrieval based on propos...
AIML
2008
13 years 11 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
CADE
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...