Sciweavers

3047 search results - page 170 / 610
» On the Meaning of Logical Completeness
Sort
View
126
Voted
KRDB
2003
111views Database» more  KRDB 2003»
15 years 2 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
123
Voted
ICCD
2004
IEEE
137views Hardware» more  ICCD 2004»
15 years 10 months ago
Comparative Study of Strategies for Formal Verification of High-Level Processors
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
Miroslav N. Velev
132
Voted
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
15 years 5 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...
128
Voted
JOLLI
2008
145views more  JOLLI 2008»
15 years 1 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
124
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
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...
Martin Grohe