Sciweavers

158 search results - page 11 / 32
» Strong logics of first and second order
Sort
View
124
Voted
FSS
2010
102views more  FSS 2010»
14 years 11 months ago
Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
Guilin Qi, Weiru Liu, David A. Bell
122
Voted
IANDC
2008
114views more  IANDC 2008»
15 years 1 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
ACMICEC
2005
ACM
151views ECommerce» more  ACMICEC 2005»
15 years 7 months ago
Product knowledge reasoning: a DL-based approach
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
Nizamuddin Channa, Shanping Li, Xiangjun Fu
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 1 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
CONCUR
2006
Springer
15 years 3 months ago
Model Checking Quantified Computation Tree Logic
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...
Arend Rensink