2308 search results - page 223 / 462 » Representing Symbolic Reasoning |
137
click to vote
RR
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we discuss the draft OWL 2 RL profile from the perspective of applying the constituent rules over Web data. In particular, borrowing from previous work, we discuss ...
192
click to vote
LICS
2008
IEEE
16 years 29 days ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
183
click to vote
SYNASC
2008
IEEE
16 years 29 days ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
191
click to vote
AIIA
2007
Springer
16 years 23 days ago
2007
Springer
A procedure founded in instance-based learning is presented, for performing a form of analogical reasoning on knowledge bases expressed in a wide range of ontology languages. The p...
156
click to vote
SGAI
2007
Springer
16 years 21 days ago
2007
Springer
A method must be provided to support the analysis of security policy rules interdependencies in a (possibly distributed) environment. We propose a Conceptual Graphs based language...