Sciweavers

49 search results - page 5 / 10
» On Market-Inspired Approaches to Propositional Satisfiabilit...
Sort
View
SIGSOFT
2007
ACM
14 years 7 months ago
A specification-based approach to testing software product lines
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
Engin Uzuncaova, Daniel Garcia, Sarfraz Khurshid, ...
KR
1998
Springer
13 years 11 months ago
A Planning Algorithm not based on Directional Search
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the p...
Jussi Rintanen
SOFSEM
2010
Springer
14 years 3 months ago
Finding and Certifying Loops
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
JAR
2000
77views more  JAR 2000»
13 years 6 months ago
Proving Consistency Assertions for Automotive Product Data Management
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
Wolfgang Küchlin, Carsten Sinz
AIPS
2009
13 years 8 months ago
SAT-Based Parallel Planning Using a Split Representation of Actions
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...