4401 search results - page 522 / 881 » Computing with Default Logic |
171
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
151
click to vote
ISVC
2007
Springer
16 years 29 days ago
2007
Springer
Video event understanding requires a formalism that can model complex logical temporal and spatial relations between composing sub-events. In this paper we argue that the Petri-Net...
170
Voted
KSEM
2007
Springer
16 years 29 days ago
2007
Springer
We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We first introduce a simple logical language...
192
click to vote
SEMWEB
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. The WSMO-MX matchmaker applies different matching filters to retrieve WSMO-oriented service descriptions that are semantically relevant to a given query with respect to...
150
click to vote
LICS
2006
IEEE
16 years 25 days ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...