27 search results - page 4 / 6 » Dependency Calculus: Reasoning in a General Point Relation A... |
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
LICS
1990
IEEE
14 years 18 days ago
1990
IEEE
In the paper "Extensional PERs" by P. Freyd, P. Mulry, G. Rosolini and D. Scott, a category C of "pointed complete extensional PERs" and computable maps is int...
EPIA
1995
Springer
14 years 3 days ago
1995
Springer
Abstract. Argument-based formalisms are gaining popularity as models of nonmonotonic reasoning. Central in such formalisms is a notion of argument. Arguments are formal reconstruct...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...