1269 search results - page 47 / 254 » Pi-Calculus in Logical Form |
ICLP
1992
Springer
14 years 2 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
CSL
1995
Springer
14 years 1 months ago
1995
Springer
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
JAIR
2006
13 years 10 months ago
2006
Logical hidden Markov models (LOHMMs) upgrade traditional hidden Markov models to deal with sequences of structured symbols in the form of logical atoms, rather than flat characte...
PODS
1991
ACM
14 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...
TCS
2011
13 years 4 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...