Sciweavers

1835 search results - page 250 / 367
» Classifying Description Logics
Sort
View
ICLP
1997
Springer
15 years 8 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
CIE
2006
Springer
15 years 7 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
WSPI
2004
15 years 5 months ago
A Formal Theory of Conceptual Modeling Universals
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...
Giancarlo Guizzardi, Gerd Wagner, Marten van Sinde...
GISCIENCE
2008
Springer
130views GIS» more  GISCIENCE 2008»
15 years 5 months ago
Road Networks and Their Incomplete Representation by Network Data Models
Road networks, roads, and junctions are examples of natural language terms whose semantics can be described by affordances of their physical referents. In order to define affordanc...
Simon Scheider, Werner Kuhn
JAPLL
2008
88views more  JAPLL 2008»
15 years 4 months ago
Living up to one's commitments: Agency, strategies and trust
In human social interaction, the notions of commitment and trust are strongly interrelated. A formal model for this interrelation will enable artificial agents to benefit from the...
Thomas Müller