Sciweavers

1941 search results - page 184 / 389
» On the Hardness of Approximate Reasoning
Sort
View
DLOG
2010
15 years 4 months ago
The Logical Difference For Fuzzy EL+ Ontologies
Abstract. Ontologies undergo changes for reasons such as changes in knowledge, meeting varying application requirements. Thus, for different versions of a considered ontology, it i...
Shasha Feng, Yonggang Zhang, Dantong Ouyang, Haiya...
SIGSOFT
2007
ACM
16 years 7 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
KBSE
2007
IEEE
16 years 24 days ago
An automated approach to monitoring and diagnosing requirements
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...
Yiqiao Wang, Sheila A. McIlraith, Yijun Yu, John M...
GIS
2008
ACM
15 years 7 months ago
Combining 3-D geovisualization with force feedback driven user interaction
We describe a prototype software system for investigating novel human-computer interaction techniques for 3-D geospatial data. This system, M4-Geo (Multi-Modal Mesh Manipulation o...
Adam Faeth, Michael Oren, Chris Harding
AICOM
2006
129views more  AICOM 2006»
15 years 6 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone