Sciweavers

2022 search results - page 91 / 405
» Complexity of Non-Monotonic Logics
Sort
View
98
Voted
FPGA
2009
ACM
148views FPGA» more  FPGA 2009»
15 years 7 months ago
SmartOpt: an industrial strength framework for logic synthesis
In recent years, the maximum logic capacity of each successive FPGA family has been increasing by more than 50%, which motivates scalable solutions. Meanwhile, academic research i...
Stephen Jang, Dennis Wu, Mark Jarvin, Billy Chan, ...
83
Voted
LICS
2008
IEEE
15 years 7 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe
87
Voted
AGP
2003
IEEE
15 years 6 months ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal
81
Voted
APAL
2010
115views more  APAL 2010»
15 years 26 days ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
84
Voted
WOLLIC
2009
Springer
15 years 7 months ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...