Sciweavers

2062 search results - page 131 / 413
» Derivatives of Logical Formulas
Sort
View
ECAI
2008
Springer
15 years 5 months ago
Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
Anbu Yue, Weiru Liu
JAIR
2008
145views more  JAIR 2008»
15 years 4 months ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
JACM
2002
122views more  JACM 2002»
15 years 3 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
IGPL
2011
14 years 7 months ago
Interpolation and FEP for logics of residuated algebras
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
Wojciech Buszkowski
VLSID
2003
IEEE
144views VLSI» more  VLSID 2003»
16 years 4 months ago
The Impact of Bit-Line Coupling and Ground Bounce on CMOS SRAM Performance
In this paper, we provide an analytical framework to study the inter-cell and intra-cell bit-line coupling when it is superimposed with the ground bounce effect and show how those...
Li Ding 0002, Pinaki Mazumder