322 search results - page 53 / 65 » Combinations of Abstract Domains for Logic Programming |
103
Voted
FOIKS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
CP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
ECOOP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
ECSQARU
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
115
Voted
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...