Sciweavers

1995 search results - page 135 / 399
» What's the Problem
Sort
View
NDJFL
1998
105views more  NDJFL 1998»
15 years 3 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
AIL
2004
107views more  AIL 2004»
15 years 4 months ago
AI and the Conquest of Complexity in Law
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
L. Bibel
CTW
2002
91views more  CTW 2002»
15 years 3 months ago
Can We Ever Escape from Data Overload? A Cognitive Systems Diagnosis
ive. This characterization leads to model-based abstractions and representation design techniques as potential solutions. Many of the existing approaches to coping with data overlo...
David D. Woods, Emily S. Patterson, Emilie M. Roth
PASTE
2004
ACM
15 years 9 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
NN
2006
Springer
234views Neural Networks» more  NN 2006»
15 years 4 months ago
Attention in natural scenes: Neurophysiological and computational bases
How does attention operate in natural scenes? We show that the receptive fields of inferior temporal cortex neurons that implement object representations become small and located ...
Edmund T. Rolls, Gustavo Deco