Sciweavers

2225 search results - page 199 / 445
» Logical Structures in the Lexicon
Sort
View
SIGSOFT
2010
ACM
15 years 4 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
ER
2007
Springer
130views Database» more  ER 2007»
16 years 22 days ago
Towards Automated Reasoning on ORM Schemes
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...
Mustafa Jarrar
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