3090 search results - page 173 / 618 » On Testing Answer-Set Programs |
133
click to vote
ISSTA
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a specification-based testing approach that compares software specifications defined at different f abstraction, e.g. architecture and implementation, agai...
172
click to vote
DLOG
2008
15 years 7 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
166
Voted
JACM
2010
15 years 3 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
136
Voted
ISOLA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Lurette is an automated testing tool dedicated to reactive programs. The test process is automated at two levels: given a formal description of the System Under Test (SUT...
172
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...