2214 search results - page 140 / 443 » Complexity of Reasoning |
148
click to vote
LOPSTR
1997
Springer
15 years 7 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
132
Voted
TIME
1994
IEEE
15 years 7 months ago
1994
IEEE
: In this paper we explain how we have integrated the functionalities of a constraint management system and a temporal data base system to enable a model-based control of systems t...
116
click to vote
KR
1989
Springer
15 years 7 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
104
click to vote
CTRSA
2009
Springer
15 years 7 months ago
2009
Springer
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
103
Voted
CSL
2006
Springer
15 years 7 months ago
2006
Springer
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...