Sciweavers

2920 search results - page 35 / 584
» Finite information logic
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
FLAIRS
2006
13 years 11 months ago
Reasoning about Knowledge and Continuity
The aim of this paper is to extend the modal logic of knowledge due to Moss and Parikh by state transformers arising, eg, from actions of agents. The peculiarity of Moss and Parik...
Bernhard Heinemann
CONCUR
2004
Springer
14 years 3 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
UAI
1989
13 years 11 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
FSS
2006
88views more  FSS 2006»
13 years 10 months ago
T-norm-based logics with an independent involutive negation
In this paper we investigate the addition of arbitrary independent involutive negations to t-norm based logics. We deal with several extensions of MTL and establish general comple...
Tommaso Flaminio, Enrico Marchioni