130 search results - page 14 / 26 » A Logical Study of Partial Entailment |
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
AGP
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
PODS
2009
ACM
14 years 7 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
ISCI
2010
2010
Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics
13 years 5 months ago
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...