Sciweavers

1950 search results - page 2 / 390
» Lambda-Free Logical Frameworks
Sort
View
CADE
2007
Springer
14 years 5 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani
ATAL
2007
Springer
13 years 11 months ago
A framework for reasoning about rational agents
We propose an extension of alternating-time temporal logic, that can be used for reasoning about the behavior and abilities of agents under various rationality assumptions. Catego...
Wojciech Jamroga, Nils Bulling
LFCS
2009
Springer
13 years 12 months ago
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissib...
Rosalie Iemhoff, George Metcalfe
LICS
2010
IEEE
13 years 3 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
FSS
2010
119views more  FSS 2010»
13 years 3 months ago
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna