135 search results - page 14 / 27 » Constructive Logic with Strong Negation as a Substructural L... |
120
Voted
KR
2004
Springer
15 years 7 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
102
Voted
PLPV
2010
ACM
15 years 10 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
123
click to vote
MST
2010
14 years 8 months ago
2010
This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate wh...
116
click to vote
ICFP
2010
ACM
15 years 2 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
99
Voted
SAS
2005
Springer
15 years 7 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...