Sciweavers

479 search results - page 22 / 96
» A quantified logic of evidence
Sort
View
IJAC
2010
118views more  IJAC 2010»
13 years 5 months ago
Algebraic Characterization of Logically Defined Tree Languages
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr
Zoltán Ésik, Pascal Weil
ENTCS
2006
114views more  ENTCS 2006»
13 years 8 months ago
Run-Time Checking of Dynamic Properties
We consider a first-order property specification language for run-time monitoring of dynamic systems. The language is based on a linear-time temporal logic and offers two kinds of...
Oleg Sokolsky, Usa Sammapun, Insup Lee, Jesung Kim
AML
2006
49views more  AML 2006»
13 years 8 months ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
CSL
2010
Springer
13 years 9 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
SUM
2009
Springer
14 years 2 months ago
Query Answering in Belief Logic Programming
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
Hui Wan, Michael Kifer