711 search results - page 55 / 143 » Modal Logics are Coalgebraic |
APAL
2006
14 years 10 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
IJCAI
1997
14 years 11 months ago
1997
This paper investigates the evaluation method of decision procedures for multi-modal logic proposed by Giunchiglia and Sebastiani as an adaptation from the evaluation method of Mi...
JAPLL
2011
14 years 5 months ago
2011
The paper proposes a formal analysis of a theory of norms resulting from pulling together Anderson’s reduction, the analysis of counts-as, and a novel approach to the formal rep...
110
Voted
PLANX
2007
14 years 11 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
ECSQARU
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...