Sciweavers

137 search results - page 10 / 28
» Conditional independence in propositional logic
Sort
View
ENTCS
2007
95views more  ENTCS 2007»
13 years 7 months ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed
LOGCOM
2002
85views more  LOGCOM 2002»
13 years 7 months ago
Fibring Labelled Deduction Systems
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
João Rasga, Amílcar Sernadas, Cristi...
ECCC
2010
72views more  ECCC 2010»
13 years 6 months ago
Paris-Harrington tautologies
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 12 months ago
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
Randal E. Bryant, Steven M. German, Miroslav N. Ve...
ATAL
2008
Springer
13 years 8 months ago
Anchoring institutions in agents' attitudes: towards a logical framework for autonomous multi-agent systems
The aim of this paper is to provide a logical framework for the specification of autonomous Multi-Agent Systems (MAS). A MAS is autonomous in so far as it is capable of binding (...
Benoit Gaudou, Dominique Longin, Emiliano Lorini, ...