Sciweavers

2062 search results - page 88 / 413
» Derivatives of Logical Formulas
Sort
View
125
Voted
RTA
1995
Springer
15 years 7 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
143
Voted
JANCL
2006
100views more  JANCL 2006»
15 years 3 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
210
Voted
POPL
2011
ACM
14 years 6 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
142
Voted
JELIA
2004
Springer
15 years 9 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
106
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
Research Perspectives for Logic and Deduction
The article is meant to be kind of the author's manifesto for the role of logic and deduction within Intellectics. Based on a brief analysis of this role the paper presents a...
Wolfgang Bibel