322 search results - page 10 / 65 » Combinations of Abstract Domains for Logic Programming |
CADE
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
108
click to vote
EUROGP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circui...
93
Voted
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able ...
105
Voted
WLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
PPDP
2000
Springer
15 years 3 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...