Sciweavers

856 search results - page 91 / 172
» Dependent Types in Practical Programming
Sort
View
DALT
2007
Springer
13 years 10 months ago
Structured Argumentation in a Mediator for Online Dispute Resolution
Online dispute resolution is becoming the main method when dealing with a conflict in e-commerce. A family of defeasible reasoning patterns is used to provide a useful link betwee...
Ioan Alfred Letia, Adrian Groza
ICLP
2005
Springer
14 years 2 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
PLDI
2009
ACM
14 years 1 months ago
Flow-sensitive semantics for dynamic information flow policies
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
Niklas Broberg, David Sands
PASTE
2010
ACM
14 years 1 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 8 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini