Sciweavers

275 search results - page 7 / 55
» Non-Termination Inference of Logic Programs
Sort
View
KRDB
2003
111views Database» more  KRDB 2003»
14 years 11 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
ICSE
2011
IEEE-ACM
14 years 1 months ago
Inferring better contracts
Considerable progress has been made towards automatic support for one of the principal techniques available to enhance program reliability: equipping programs with extensive contr...
Yi Wei, Carlo A. Furia, Nikolay Kazmin, Bertrand M...
SEMWEB
2010
Springer
14 years 7 months ago
Experience of Using OWL Ontologies for Automated Inference of Routine Pre-operative Screening Tests
We describe our experience of designing and implementing a knowledge-based pre-operative assessment decision support system. We developed the system using semantic web technology, ...
Matt-Mouley Bouamrane, Alan L. Rector, Martin Hurr...
UAI
2008
14 years 11 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel
PLDI
2011
ACM
14 years 16 days ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...