Sciweavers

662 search results - page 95 / 133
» Logic Programming with Ordered Disjunction
Sort
View
ASE
2010
129views more  ASE 2010»
13 years 7 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
CAV
2007
Springer
110views Hardware» more  CAV 2007»
14 years 1 months ago
Hector: Software Model Checking with Cooperating Analysis Plugins
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
Nathaniel Charlton, Michael Huth
ECAI
2000
Springer
13 years 12 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
APWEB
2006
Springer
13 years 11 months 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...
POPL
2004
ACM
14 years 8 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann