Results 211 to 220 of about 1,544 (260)
Some of the next articles are maybe not open access.
On deciding subsumption problems
Annals of Mathematics and Artificial Intelligence, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uwe Egly +2 more
exaly +3 more sources
1990
Subsumption used in subtyping breaks the term-as-proofs paradigm. Semantics most naturally are associated with proofs. Thus a problem of coherence arises: different typing proofs of the same term must have related meanings. We propose a proof-theoretical, rewriting approach to this problem.
P. L. Curien, GHELLI, GIORGIO
openaire +2 more sources
Subsumption used in subtyping breaks the term-as-proofs paradigm. Semantics most naturally are associated with proofs. Thus a problem of coherence arises: different typing proofs of the same term must have related meanings. We propose a proof-theoretical, rewriting approach to this problem.
P. L. Curien, GHELLI, GIORGIO
openaire +2 more sources
ACM SIGCAS Computers and Society, 1999
The difference between computers and simple machines is the extent to which computer systems subsume design and development decisions over which users have little or no control. Normally, such decisions are all but forgotten after implementation.
openaire +1 more source
The difference between computers and simple machines is the extent to which computer systems subsume design and development decisions over which users have little or no control. Normally, such decisions are all but forgotten after implementation.
openaire +1 more source
2001
XML data is often used (validated, stored, queried, etc) with respect to different types. Understanding the relationship between these types can provide important information for manipulating this data. We propose a notion of subsumption for XML to capture such relationships.
Kuper, Gabriel Mark, SIMEON J.
openaire +2 more sources
XML data is often used (validated, stored, queried, etc) with respect to different types. Understanding the relationship between these types can provide important information for manipulating this data. We propose a notion of subsumption for XML to capture such relationships.
Kuper, Gabriel Mark, SIMEON J.
openaire +2 more sources
On a Semantic Subsumption Test
2005We observe, that subsumption of clauses (in the language of first order logic), so far understood as a syntactic notion, can also be defined by semantical means. Subsumption is NP-complete and testing subsumption takes roughly half of the running time of a typical first order resolution-based theorem prover.
Jerzy Marcinkowski +2 more
openaire +1 more source
A Complete Subsumption Algorithm
2003Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of larger systems (e.g., learning systems). Hence, the need of techniques that can perform such a process with reduced time/space requirements (specifically when performing resolution ...
Stefano Ferilli +3 more
openaire +1 more source
Spatial analogy and subsumption
1992Publisher Summary This chapter describes spatial analogy and subsumption. A concept image may only have other concepts as parts. An unclassified or instance image can only have other instances as parts. A classification of an image is the inference of a link to a concept.
Darrell Conklin, Janice I. Glasgow
openaire +1 more source
Experiments with the subsumption architecture
Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002The subsumption architecture (SA) is a special case of behavior-based control for robotics. Behavioral modules are added as 'layers', with each layer performing a complete behavior. Higher-level behaviors override lower level ones by taking control of their effectors or manipulating their internal states.
Ralph Hartley, Frank J. Pipitone
openaire +1 more source
Undecidability of subsumption in NIKL
Artificial Intelligence, 1989Abstract Subsumption—determining whether one concept is more general than another—is known to be NP-hard for all reasonably expressive terminological logics, but, up to now, the decidability of subsumption for terminological logics used in current knowledge representation systems such as NIKL remained unknown. This paper shows that subsumption in the
openaire +1 more source