507 search results - page 75 / 102 » Automating first-order relational logic |
85
Voted
CADE
2001
Springer
16 years 28 days 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...
LPNMR
2009
Springer
15 years 7 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...
115
click to vote
NMR
2004
Springer
15 years 6 months ago
2004
Springer
The action language A is a simple high-level language for describing transition systems. In this paper, we extend the action language A by allowing a unary modal operator in the u...
134
click to vote
MPC
2010
Springer
15 years 2 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
118
click to vote
ICLP
2001
Springer
15 years 5 months ago
2001
Springer
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...