3773 search results - page 221 / 755 » Logical Reasoning |
156
click to vote
ICFP
2005
ACM
16 years 5 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
185
click to vote
JAPLL
2007
15 years 5 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
157
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
171
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
157
click to vote
DLOG
2009
15 years 3 months ago
2009
The CEL system is known for its scalability of reasoning in the lightweight DL EL++ which has been proved suitable for several ontology applications, most notably from the life sci...