1941 search results - page 241 / 389 » Reasoning about Computations Using Two-Levels of Logic |
110
click to vote
ICLP
1990
Springer
15 years 7 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
121
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
136
click to vote
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
149
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
119
click to vote
CSEE
2000
Springer
15 years 8 months ago
2000
Springer
Accurate and complete requirements specifications are crucial for the design and implementation of high-quality software. Unfortunately, the articulation and verification of softw...