1199 search results - page 104 / 240 » Automated Extraction of Problem Structure |
ISSRE
2010
IEEE
13 years 7 months ago
2010
IEEE
—Web 2.0 applications are increasing in popularity. However, they are also prone to errors because of their dynamic nature. This paper presents DoDOM, an automated system for tes...
DAC
2001
ACM
14 years 10 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
ICLP
1990
Springer
14 years 1 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
LICS
1999
IEEE
14 years 1 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
SOCO
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Bridging problem domain and solution in product line engineering is a time-consuming and error-prone process. Since both domains are structured differently (features vs....