934 search results - page 75 / 187 » Elementary Sets of Logic Programs |
SEFM
2005
IEEE
15 years 3 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
111
click to vote
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Shared mutable objects pose grave challenges in reasoning, especially for data abstraction and modularity. This paper presents a novel logic for erroravoiding partial correctness o...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
105
click to vote
IDA
2008
Springer
14 years 9 months ago
2008
Springer
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
100
click to vote
AAAI
2006
14 years 11 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...