Sciweavers

3573 search results - page 697 / 715
» Reasoning about Codata
Sort
View
FUIN
2010
112views more  FUIN 2010»
13 years 8 months ago
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Luca Pulina, Armando Tacchella
HUC
2010
Springer
13 years 8 months ago
Routine as resource for the design of learning systems
Even though the coordination of kids’ activities is largely successful, the modern dual income family still regularly experiences breakdowns in their practices. Families often r...
Scott Davidoff
ICFEM
2010
Springer
13 years 8 months ago
A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
Scott West, Sebastian Nanz, Bertrand Meyer
ICSE
2010
IEEE-ACM
13 years 8 months ago
Fourth International Workshop on Software Clones (IWSC)
Software clones are identical or similar pieces of code. They are often the result of copy–and–paste activities as ad-hoc code reuse by programmers. Software clones research i...
Katsuro Inoue, Stanislaw Jarzabek, James R. Cordy,...
IGPL
2010
132views more  IGPL 2010»
13 years 8 months ago
Changing legal systems: legal abrogations and annulments in Defeasible Logic
In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in simi...
Guido Governatori, Antonino Rotolo