Sciweavers

288 search results - page 23 / 58
» Interactive Termination Proofs Using Termination Cores
Sort
View
LFCS
2009
Springer
15 years 4 months ago
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
Uwe Keller, Stijn Heymans
ISCC
2007
IEEE
126views Communications» more  ISCC 2007»
15 years 3 months ago
VoIP Communications in Wireless Ad-hoc Network with Gateways
In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET–cell) to acces...
Elena Fasolo, Federico Maguolo, Andrea Zanella, Mi...
98
Voted
ATAL
2005
Springer
14 years 11 months ago
A formal framework for agent interaction semantics
Although informative, the semantic definition proposed for the most standard agent communication language (FIPA ACL 1997) is complicated and contentious, while published interact...
Shamimabi Paurobally, Jim Cunningham, Nicholas R. ...
CSL
2007
Springer
15 years 3 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
POPL
2005
ACM
15 years 9 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...