Sciweavers

241 search results - page 12 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
FOSSACS
2006
Springer
13 years 11 months ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
FOSSACS
2010
Springer
14 years 2 months ago
Solvability in Resource Lambda-Calculus
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...
Michele Pagani, Simona Ronchi Della Rocca
WADT
1998
Springer
13 years 11 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
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
PLDI
2009
ACM
14 years 9 days ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...