Sciweavers

2035 search results - page 102 / 407
» On the complexity of stratified logics
Sort
View
CSR
2008
Springer
15 years 8 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
UAI
2003
15 years 7 months ago
A Logic for Reasoning about Evidence
We introduce a logic for reasoning about evidence that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after makin...
Joseph Y. Halpern, Riccardo Pucella
ENTCS
2007
90views more  ENTCS 2007»
15 years 6 months ago
Undecidability of Multi-modal Hybrid Logics
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
Martin Mundhenk, Thomas Schneider 0002
ASP
2003
Springer
15 years 11 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri
ICSM
1998
IEEE
15 years 10 months ago
Detection of Logical Coupling Based on Product Release History
Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems--those consisting of several millions of...
Harald Gall, Karin Hajek, Mehdi Jazayeri