725 search results - page 58 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
188
click to vote
CC
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
159
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
162
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
183
click to vote
ASAP
2008
IEEE
16 years 14 days ago
2008
IEEE
Process technology has reduced in size such that it is possible to implement complete applicationspecific architectures as Systems-on-Chip (SoCs) using both Application-Specific I...
210
click to vote
ILP
2007
Springer
16 years 4 days ago
2007
Springer
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...