Sciweavers

82 search results - page 10 / 17
» CR-Prolog with Ordered Disjunction
Sort
View
LFCS
1992
Springer
15 years 1 months ago
Denotations for Classical Proofs - Preliminary Results
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
Philippe de Groote
CAV
2010
Springer
198views Hardware» more  CAV 2010»
15 years 1 months ago
Termination Analysis with Compositional Transition Invariants
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...
AIRS
2006
Springer
15 years 1 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
CSL
2008
Springer
14 years 11 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
IJCAI
1993
14 years 10 months ago
Rule-Based Regression
While decision trees have been used primarily for classification, they can also model regression or function approximation. Like classification trees, regression trees often yield...
Sholom M. Weiss, Nitin Indurkhya