3527 search results - page 363 / 706 » Test Automation in Practice |
137
Voted
KGC
1993
Springer
15 years 8 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
106
click to vote
ICLP
1989
Springer
15 years 8 months ago
1989
Springer
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
151
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
156
click to vote
CSL
2006
Springer
15 years 8 months ago
2006
Springer
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
160
click to vote
EWCBR
2006
Springer
15 years 8 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...