54 search results - page 9 / 11 » Non-termination Inference for Constraint Logic Programs |
VLDB
1990
ACM
13 years 12 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
ARGMAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
ICLP
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
MIDDLEWARE
2007
Springer
14 years 2 months ago
2007
Springer
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...