Sciweavers

622 search results - page 40 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
TPHOL
2008
IEEE
14 years 2 months ago
Formal Reasoning About Causality Analysis
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...
Jens Brandt, Klaus Schneider
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 12 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
CSL
2007
Springer
14 years 2 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
ANOR
2007
80views more  ANOR 2007»
13 years 8 months ago
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
John J. H. Forrest, John A. Tomlin