9532 search results - page 18 / 1907 » Logic, Graphs, and Algorithms |
121
click to vote
AAAI
2008
15 years 3 days ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
DAC
2006
ACM
15 years 12 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
FSTTCS
2005
Springer
15 years 4 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
CSL
2008
Springer
15 years 23 days ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
106
click to vote
BIRTHDAY
2010
Springer
15 years 3 days ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...