Sciweavers

1174 search results - page 67 / 235
» A Logical Approach to Abstract Algebra
Sort
View
ML
2008
ACM
150views Machine Learning» more  ML 2008»
13 years 10 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
WOA
2007
13 years 11 months ago
Declarative representation of curricula models: an LTL- and UML-based approach
Abstract—In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical lang...
Matteo Baldoni, Cristina Baroglio, Giuseppe Berio,...
BIRTHDAY
2010
Springer
13 years 10 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
VLDB
1994
ACM
152views Database» more  VLDB 1994»
14 years 2 months ago
The GMAP: A Versatile Tool for Physical Data Independence
Physical data independence is touted as a central feature of modern database systems. Both relational and object-oriented systems, however, force users to frame their queries in t...
Odysseas G. Tsatalos, Marvin H. Solomon, Yannis E....
MFCS
2007
Springer
14 years 4 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers