895 search results - page 65 / 179 » A Spectrum of Applications of Automated Reasoning |
127
click to vote
ICLP
1994
Springer
15 years 8 months ago
1994
Springer
The consequences of a logic program depend in general upon both the rules of the program and its language. However the consequences of some programs are independent of the choice ...
150
click to vote
LOPSTR
1994
Springer
15 years 8 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
156
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
133
click to vote
LICS
2000
IEEE
15 years 8 months ago
2000
IEEE
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
119
click to vote
ECSQARU
1997
Springer
15 years 8 months ago
1997
Springer
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...