Sciweavers

2529 search results - page 251 / 506
» The Logical Structure of Binding
Sort
View
DLOG
2003
15 years 8 months ago
Relationships with other Formalisms
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...
Ulrike Sattler, Diego Calvanese, Ralf Molitor
EUROPAR
2001
Springer
15 years 11 months ago
Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse
Operand bypass logic might be one of the critical structures for future microprocessors to achieve high clock speed. The delay of the logic imposes the execution time budget to be ...
Toshinori Sato, Itsujiro Arita
LICS
2010
IEEE
15 years 4 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
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...
Martin Grohe
ECIS
2000
15 years 8 months ago
Constructing New Media
: Media are explored to envision, to design, and to implement platforms for knowledge management within communities. They actively shape, support and develop the community being re...
Martina Klose, Ulrike Lechner
JAR
2007
132views more  JAR 2007»
15 years 6 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz