10568 search results - page 423 / 2114 » Computer Intelligence and Formalization |
185
click to vote
IWANN
2009
Springer
16 years 1 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
177
click to vote
KCAP
2009
ACM
16 years 1 months ago
2009
ACM
Workflows are becoming an increasingly more common paradigm to manage scientific analyses. As workflow repositories start to emerge, workflow retrieval and discovery becomes a cha...
201
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
188
click to vote
FUZZIEEE
2007
IEEE
16 years 1 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
190
click to vote
EPIA
2007
Springer
16 years 28 days ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...