Sciweavers

122 search results - page 20 / 25
» Abductive Logic Programming by Nonground Rewrite Systems
Sort
View
ICALP
2007
Springer
14 years 3 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
TASE
2008
IEEE
14 years 3 months ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang
CSCLP
2008
Springer
13 years 10 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
COMPSEC
2004
105views more  COMPSEC 2004»
13 years 8 months ago
Rico: a security proxy for mobile code
Security technology suitable for the burgeoning embedded system market has not been widespread. Untrusted code downloaded from the Internet poses numerous security risks due to th...
Yougang Song, Brett D. Fleisch
IFIP
2004
Springer
14 years 2 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack