Sciweavers

2062 search results - page 39 / 413
» Derivatives of Logical Formulas
Sort
View
LOGCOM
2010
96views more  LOGCOM 2010»
14 years 9 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
AISC
2004
Springer
15 years 4 months ago
A Decision Procedure for Equality Logic with Uninterpreted Functions
The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced...
Olga Tveretina
ACL2
2006
ACM
15 years 2 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
SYNTHESE
2008
81views more  SYNTHESE 2008»
14 years 10 months ago
Adequate formalization
This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by d...
Michael Baumgartner, Timm Lampert
FOSSACS
2008
Springer
15 years 10 days ago
Coalgebraic Logic and Synthesis of Mealy Machines
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...