1097 search results - page 69 / 220 » Revision Programming = Logic Programming Integrity Constra... |
145
click to vote
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...
160
Voted
CADE
2009
Springer
16 years 3 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
138
click to vote
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
106
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
156
click to vote
ILP
2004
Springer
15 years 8 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...