217 search results - page 42 / 44 » A Logic for Approximate First-Order Reasoning |
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
84
Voted
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
103
Voted
ASP
2005
Springer
15 years 3 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
LPAR
2004
Springer
15 years 2 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
FPL
2000
Springer
15 years 1 months ago
2000
Springer
Coarse-grain reconfigurable architectures have been a matter of intense research in the last few years. They promise to be more adequate for computational tasks due to their better...