Sciweavers

3047 search results - page 8 / 610
» On the Meaning of Logical Completeness
Sort
View
MFCS
2009
Springer
14 years 1 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He
TIME
2009
IEEE
14 years 2 months ago
Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time
—This paper presents various semantic interpretations for logics of knowledge and time with prefect recall. We allow both past and future operators and examine the interpretation...
Szabolcs Mikulás, Mark Reynolds, Tim French
JFPLC
2000
13 years 8 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
EPIA
2005
Springer
14 years 26 days ago
Operational Semantics for DyLPs
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
Federico Banti, José Júlio Alferes, ...
CAEPIA
2003
Springer
14 years 17 days ago
A Multimodal Logic Approach to Order of Magnitude Qualitative Reasoning
Non-classical logics have proven to be an adequate framework to formalize knowledge representation. In this paper we focus on a multimodal approach to formalize order-of-magnitude ...
Alfredo Burrieza, Manuel Ojeda-Aciego