213 search results - page 15 / 43 » Automated Termination Analysis for Logic Programs with Cut |
ICLP
1991
Springer
15 years 3 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
IOR
2006
14 years 11 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
104
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
99
Voted
ICLP
1999
Springer
15 years 4 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
ASP
2003
Springer
15 years 5 months ago
2003
Springer
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. This is not quite so. This paper shows an...