746 search results - page 42 / 150 » Connectionist Propositional Logic |
134
Voted
IANDC
2010
15 years 2 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
132
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
166
click to vote
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
109
Voted
SAC
2008
ACM
15 years 2 months ago
2008
ACM
In a hypothesis-based approach to digital investigation, the investigator formulates his hypothesis about which events took place, and tests them using the evidence available. A f...
155
Voted
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...