Sciweavers

3047 search results - page 14 / 610
» On the Meaning of Logical Completeness
Sort
View
NMR
2004
Springer
14 years 21 days ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
PPDP
2004
Springer
14 years 21 days ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
ECAI
2006
Springer
13 years 11 months ago
Knowing Minimum/Maximum n Formulae
Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean `the reasoner has at least n different beliefs'. The resul...
Thomas Ågotnes, Natasha Alechina
ICTL
1994
13 years 11 months ago
Completeness through Flatness in Two-Dimensional Temporal Logic
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
Yde Venema
CSL
2004
Springer
14 years 23 days ago
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...