2012 search results - page 248 / 403 » CORAL - Control, Relations and Logic |
158
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
146
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
134
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
143
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime...
154
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...