Sciweavers

2303 search results - page 218 / 461
» On the logic of argumentation theory
Sort
View
ENTCS
2006
161views more  ENTCS 2006»
15 years 6 months ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
MLQ
2000
90views more  MLQ 2000»
15 years 6 months ago
Approximate Reasoning Based on Similarity
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
Loredana Biacino, Giangiacomo Gerla, Mingsheng Yin...
EUSFLAT
2009
173views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
Application of Zadeh's Impossibility Principle to Approximate Explanation
Abstract: We consider application of Zadeh's impossibility principle and extended logic FLe to approximate scientific explanation from the standpoint of the philosophy of scie...
Vesa A. Niskanen
APAL
2010
115views more  APAL 2010»
15 years 6 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev