227 search results - page 39 / 46 » A Model Theory for Paraconsistent Logic Programming |
CP
2007
Springer
14 years 2 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
FUIN
2008
13 years 8 months ago
2008
Abstract. The ability to recognize human activities from sensory information is essential for developing the next generation of smart devices. Many human activity recognition tasks...
FBIT
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...