Sciweavers

565 search results - page 110 / 113
» Extending Answer Sets for Logic Programming Agents
Sort
View
TAP
2009
Springer
178views Hardware» more  TAP 2009»
14 years 2 months ago
Dynamic Symbolic Execution for Testing Distributed Objects
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
Andreas Griesmayer, Bernhard K. Aichernig, Einar B...
ICFP
2005
ACM
14 years 7 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
14 years 1 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag
ESWS
2008
Springer
13 years 9 months ago
Contextual and Metadata-based Approach for the Semantic Annotation of Heterogeneous Documents
We present SHIRI-Annot an automatic ontology-driven and unsupervised approach for the semantic annotation of documents which contain well structured parts and not well structured o...
Mouhamadou Thiam, Nathalie Pernelle, Nacéra...
AAAI
1993
13 years 9 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler