Sciweavers

226 search results - page 33 / 46
» Reasoning about the Semantic Web using Answer Set Programmin...
Sort
View
78
Voted
IJCAI
2007
14 years 11 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
87
Voted
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 4 months ago
User Modeling Combining Access Logs, Page Content and Semantics
The paper proposes an approach to modeling users of large Web sites based on combining different data sources: access logs and content of the accessed pages are combined with sema...
Blaz Fortuna, Dunja Mladenic, Marko Grobelnik
SEMWEB
2009
Springer
15 years 4 months ago
Semantically-Aided Business Process Modeling
Enriching business process models with semantic annotations taken from an ontology has become a crucial necessity both in service provisioning, integration and composition, and in ...
Chiara Di Francescomarino, Chiara Ghidini, Marco R...
HASKELL
2009
ACM
15 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
LOGCOM
2007
126views more  LOGCOM 2007»
14 years 9 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones