1144 search results - page 105 / 229 » Logic programming for combinatorial problems |
191
Voted
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
149
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
158
click to vote
CONPAR
1992
15 years 10 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
196
click to vote
SEBD
2001
15 years 7 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
182
click to vote
FUIN
2008
15 years 6 months ago
2008
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...