Sciweavers

344 search results - page 57 / 69
» Probabilistic Inductive Logic Programming
Sort
View
CSL
2007
Springer
14 years 2 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
IEAAIE
2004
Springer
14 years 2 months ago
Machine Learning Approaches for Inducing Student Models
The main issue in e-learning is student modelling, i.e. the analysis of a student’s behaviour and prediction of his/her future behaviour and learning performance. Indeed, it is d...
Oriana Licchelli, Teresa Maria Altomare Basile, Ni...
APWEB
2006
Springer
14 years 14 days ago
Providing an Uncertainty Reasoning Service for Semantic Web Application
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
Lei Li, Qiaoling Liu, Yunfeng Tao, Lei Zhang, Jian...
CSL
2007
Springer
14 years 2 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
AINA
2007
IEEE
14 years 22 days ago
Specification Synthesis for Monitoring and Analysis of MANET Protocols
This paper introduces an approach to automatic synthesis of the specification models of routing protocol behavior from the observed flow of the network traffic. In particular, our...
Natalia Stakhanova, Samik Basu, Wensheng Zhang, Xi...