1131 search results - page 147 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
132
click to vote
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We introduce, analyze, and experimentally examine co-solvability, an ability of a solution to solve a pair of fitness cases (tests). Based on this concept, we devise a co...
136
click to vote
CN
2004
15 years 13 days ago
2004
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs...
95
Voted
ICFP
2002
ACM
16 years 16 days ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
114
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
105
Voted
ICLP
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...