Sciweavers

30 search results - page 4 / 6
» Guarded Open Answer Set Programming
Sort
View
WECWIS
2006
IEEE
103views ECommerce» more  WECWIS 2006»
14 years 1 days ago
Toward Semantic Composition of Web Services with MOVE
This paper describes a software solution for the WSChallenge 2006. We introduce the MOVE framework that has been applied to this challenge. Also, the architecture, algorithms, and...
Jürgen Dorn, Albert Rainer, Peter Hrastnik
ICALP
2003
Springer
13 years 11 months ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
ESWS
2009
Springer
14 years 18 days ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
SIGSOFT
2003
ACM
14 years 6 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
PPDP
2010
Springer
13 years 3 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu