Sciweavers

605 search results - page 20 / 121
» Dealing with logical omniscience
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
FUZZIEEE
2007
IEEE
13 years 11 months ago
Asymptotic Idempotency
This paper deals with aggregation operators. A new class of aggregation operators, called asymptotically idempotent, is introduced. A generalization of the basic notion of aggregat...
Roberto Ghiselli Ricci
IJCAI
2001
13 years 9 months ago
High Performance Reasoning with Very Large Knowledge Bases: A Practical Case Study
We present an empirical analysis of optimization techniques devised to speed up the so-called TBox classification supported by description logic systems which have to deal with ve...
Volker Haarslev, Ralf Möller
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 7 months ago
A Sequent Calculus for Modelling Interferences
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in pro...
Christophe Fouqueré
IBERAMIA
2004
Springer
14 years 1 months ago
Decomposing Ordinal Sums in Neural Multi-adjoint Logic Programs
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
Jesús Medina, Enrique Mérida Caserme...