1005 search results - page 99 / 201 » Patterns for Refinement Automation |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
ECSQARU
1999
Springer
14 years 1 days ago
1999
Springer
In this paper we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we conside...
ASC
2011
13 years 2 months ago
2011
Machine learning, data mining, and several related research areas are concerned with methods for the automated induction of models and the extraction of interesting patterns from ...