Sciweavers

622 search results - page 55 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 8 months ago
Guarded Hybrid Knowledge Bases
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...
Stijn Heymans, Jos de Bruijn, Livia Predoiu, Crist...
ICLP
2004
Springer
14 years 1 months ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...
CAV
2006
Springer
129views Hardware» more  CAV 2006»
13 years 12 months ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
AAAI
2008
13 years 10 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
FASE
2010
Springer
13 years 11 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller