1916 search results - page 175 / 384 » Reasoning with class algebra |
158
click to vote
FLOPS
1999
Springer
15 years 8 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
142
click to vote
LICS
1998
IEEE
15 years 8 months ago
1998
IEEE
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
132
click to vote
LOPSTR
1998
Springer
15 years 8 months ago
1998
Springer
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
125
click to vote
ICLP
1997
Springer
15 years 8 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
119
click to vote
LICS
1990
IEEE
15 years 8 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...