6167 search results - page 223 / 1234 » Can Refinement be Automated |
113
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Generalized databases will be examined, in which attributes can be sets of attributes, or sets of sets of attributes, and other higher type constructs. A precise semantics will be ...
279
click to vote
NIL
1991
15 years 9 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
146
click to vote
CSL
1999
Springer
15 years 5 months ago
1999
Springer
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
154
click to vote
TIME
1994
IEEE
15 years 10 months ago
1994
IEEE
: In a dynamic, multi-agent environment, an the intelligent agents act as automated pilots automated intelligent agent is often faced with the for the simulated aircraft. These aut...
162
click to vote
AAAI
1994
15 years 7 months ago
1994
Large amounts of low- to medium-quality English texts are now being produced by machine translation (MT) systems, optical character readers (OCR), and non-native speakers of Engli...