Sciweavers

3776 search results - page 473 / 756
» Partition-Based Logical Reasoning
Sort
View
FLOPS
2004
Springer
15 years 8 months ago
Set-Sharing Is Not Always Redundant for Pair-Sharing
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
Francisco Bueno, Maria J. García de la Band...
KR
2004
Springer
15 years 8 months ago
Intransitivity and Vagueness
There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be ...
Joseph Y. Halpern
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...
145
Voted
CLIMA
2006
15 years 3 months ago
Multi-Agent FLUX for the Gold Mining Domain (System Description)
FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledg...
Stephan Schiffel, Michael Thielscher
102
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 2 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002