571 search results - page 45 / 115 » Domain Theory in Logical Form |
JELIA
1990
Springer
15 years 1 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
KR
2004
Springer
15 years 3 months ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
ITP
2010
15 years 1 months ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
114
click to vote
PODS
1991
ACM
15 years 1 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
125
click to vote
AGP
2010
IEEE
14 years 7 months ago
2010
IEEE
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...