Sciweavers

247 search results - page 27 / 50
» A Proof System and a Decision Procedure for Equality Logic
Sort
View
LPAR
2005
Springer
14 years 1 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
FOSSACS
2008
Springer
13 years 9 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo
ENTCS
2010
119views more  ENTCS 2010»
13 years 7 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. ...
AMAI
2005
Springer
13 years 7 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
TARK
2007
Springer
14 years 1 months ago
Judgment aggregation and the problem of truth-tracking
The problem of the aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn m...
Gabriella Pigozzi, Stephan Hartmann