Sciweavers

1059 search results - page 51 / 212
» Standard Logics Are Valuation-Nonmonotonic
Sort
View
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 10 months ago
Intensionality and Two-steps Interpretations
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
Zoran Majkic
ENTCS
2010
119views more  ENTCS 2010»
15 years 6 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
FLAIRS
2004
15 years 7 months ago
Product-based Causal Networks and Quantitative Possibilistic Bases
In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly t...
Salem Benferhat, Faiza Khellaf, Aïcha Mokhtar...
CSL
2010
Springer
15 years 6 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
FOCS
2005
IEEE
15 years 11 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi