977 search results - page 25 / 196 » Logic programming with infinite sets |
96
Voted
CORR
2004
Springer
15 years 8 days ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
105
Voted
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
129
Voted
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
134
click to vote
IPCO
2008
15 years 1 months ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
86
Voted
BIRTHDAY
2008
Springer
15 years 2 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...