331 search results - page 50 / 67 » Quantified coalition logic |
AI
2008
Springer
13 years 7 months ago
2008
Springer
It is well-known that knowledgebases may contain inconsistencies. We provide a framework of measures, based on a first-order four-valued logic, to quantify the inconsistency of a ...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
SYNTHESE
2008
13 years 7 months ago
2008
The paper argues, that a direct formalization of the way common sense thinks about the numerical identity of enduring entities, requires that traditional predicate logic is develo...
JELIA
1990
Springer
13 years 11 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...