67 search results - page 11 / 14 » The Expressiveness of a Family of Finite Set Languages |
JANCL
2007
13 years 7 months ago
2007
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
ICWS
2008
IEEE
13 years 9 months ago
2008
IEEE
In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process....
ECSQARU
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
KES
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
DLOG
2006
13 years 9 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...