322 search results - page 21 / 65 » Combinations of Abstract Domains for Logic Programming |
152
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
125
Voted
PEPM
2007
ACM
15 years 9 months ago
2007
ACM
Program query languages and pattern-detection techniques are an essential part of program analysis and manipulation systems. Queries and patterns permit the identification of the...
97
Voted
ICTAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, ...
152
Voted
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
99
Voted
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...