Sciweavers

2084 search results - page 189 / 417
» Set Constraints in Logic Programming
Sort
View
SOFSEM
2009
Springer
16 years 1 months ago
Expressiveness of Multiple Heads in CHR
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiar...
RSCTC
1993
Springer
161views Fuzzy Logic» more  RSCTC 1993»
15 years 8 months ago
Quantifying Uncertainty of Knowledge Discovered From Databases
This paper focuses on the application of rough set constructs to inductive learning from a database. A design guideline is suggested, which provides users the option to choose app...
Yang Xiang, S. K. Michael Wong, Nick Cercone
ILP
2007
Springer
15 years 10 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi
POPL
2011
ACM
14 years 7 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 11 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers