Sciweavers

4217 search results - page 9 / 844
» Computational indistinguishability logic
Sort
View
ECEASST
2010
13 years 4 months ago
On Teaching Logic and Algebraic Specification
ation and logic. The logic courses mainly provided a very abstract and
Till Mossakowski
TARK
2009
Springer
14 years 1 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
PODS
2008
ACM
152views Database» more  PODS 2008»
14 years 7 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...
AAAI
2008
13 years 9 months ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
FOSSACS
2004
Springer
14 years 24 days ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil