A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
[chapter]

2002
*
Lecture Notes in Computer Science
*

*In*this paper, we describe

*a*new framework for

*evaluating*

*Quantified*

*Boolean*

*Formulas*(QBF). The new framework is based on the Davis-Putnam (DPLL) search algorithm. ... We show that

*in*

*a*QBF setting,

*conflicting*leaves

*and*satisfying leaves

*of*the search tree both provide valuable information to the solver

*in*

*a*

*symmetric*way. ...

*A*

*symmetric*

*treatment*

*of*

*satisfaction*

*and*

*conflict*is highly desirable (

*and*useful)

*and*is the focus

*of*this paper. ...

##
###
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
[chapter]

2006
*
Lecture Notes in Computer Science
*

*Quantified*

*Boolean*

*Formulas*(QBFs) present the next big challenge for automated propositional reasoning. ... universal parts

*of*

*a*problem

*symmetrically*. ... The work

*of*Carlos Ansotegui was also partially supported by the Ministerio de Educación y Ciencia, Spain (projects TIN2004-07933-C03-03

*and*TIC2003-00950). ...

##
###
A Framework for Concrete Reputation-Systems

2005
*
BRICS Report Series
*

We provide

doi:10.7146/brics.v12i23.21889
fatcat:2jlgfmxiavhgfaxguww7uipziu
*a*mathematical framework for*a*class*of*simple reputation-based systems. ...*A*naturally occurring problem becomes how to efficiently re-*evaluate**a*policy when new behavioural information is available. ... (∀ or ∃),*and*φ is*a**quantifier*-free*boolean**formula*(i.e.,*a*propositional*formula*) with fv (φ) ⊆ {x 1 , . . . , x n }. ...##
###
A framework for concrete reputation-systems with applications to history-based access control

2005
*
Proceedings of the 12th ACM conference on Computer and communications security - CCS '05
*

We provide

doi:10.1145/1102120.1102155
dblp:conf/ccs/KrukowNS05
fatcat:oukx3ir7ivactnih6hdrrpfieu
*a*mathematical framework for*a*class*of*simple reputation-based systems. ...*A*naturally occurring problem becomes how to efficiently re-*evaluate**a*policy when new behavioural information is available. ...*a**quantifier*-free*boolean**formula*(i.e.,*a*propositional*formula*) with fv (φ) ⊆ {x1, . . . , xn}. ...##
###
Permission-Based Separation Logic for Message-Passing Concurrency

2011
*
Logical Methods in Computer Science
*

This provides

doi:10.2168/lmcs-7(3:7)2011
fatcat:3js367z76bcwjkinvaxhf2jbsm
*a*foundation for interpreting separation*formulas*for message-passing concurrency. ... We also define*a*sound proof system permitting us to infer*satisfaction*compositionally using local, separation-based reasoning. ... Acknowledgment The authors wish to acknowledge numerous referees for their incisive comments on*a*preliminary version*of*this paper. ...##
###
Management of Inconsistencies in Data Integration

2013
*
Dagstuhl Publications
*

One

doi:10.4230/dfu.vol5.10452.217
dblp:conf/dagstuhl/IoannouS13
fatcat:7taenvm7zjhmjocan3n3joierq
*of*the most challenging tasks for data integration is handling the inconsistencies that appear*in*the integrated data*in*an efficient*and*effective manner. ...*In*this chapter, we provide*a*survey on techniques introduced for handling inconsistencies*in*data integration, focusing on two groups. ... This check allows to compute consistent query answers to arbitrary*Boolean**quantifier*-free queries: if we take*a**Boolean**quantifier*-free query*in*CNF Φ = Ψ 1 ∧ . . . ∧ Ψ n , then true is not the consistent ...##
###
From boolean algebra to unified algebra

2004
*
The Mathematical intelligencer
*

*A*large part

*of*the answer may be

*in*the terminology

*and*symbols used,

*and*

*in*the explanations

*of*

*boolean*algebra found

*in*textbooks. ... This paper points out some

*of*the problems delaying the acceptance

*and*use

*of*

*boolean*algebra,

*and*suggests some solutions. ... Dijkstra, Wim Hesselink,

*and*Jim Grundy corrected some errors

*and*caused me to improve some explanations. ...

##
###
Deontic Logics Based on Boolean Algebra
[chapter]

2013
*
Outstanding Contributions to Logic
*

These combinators resemble

doi:10.1007/978-94-007-7046-1_5
fatcat:ab7uhdgxrvfrtodp4qxxulup2e
*boolean*operators,*and*therefore the theory*of**boolean*algebra offers*a*well-known mathematical framework to study the properties*of*the classic deontic operators when applied ... Some standard action combinators are action conjunction, choice between actions*and*not doing*a*given action. ... Using v we define*a**satisfaction*relationship*A*between*boolean*algebras, valuation functions,*and**formulae*, as follows: •*A*, v*A*α = β ⇐⇒ v(α) = v(β ). •*A*, v*A*Forb(α) ⇐⇒ v(α) ∈ F. •*A*, v*A*Perm(α ...##
###
Only knowing with degrees of confidence

2007
*
Journal of Applied Logic
*

*A*new logic

*of*belief (

*in*the "only knowing" family) with confidence levels is presented. ... The article also contains

*a*conceptual analysis

*of*basic notions like belief, co-belief

*and*degrees

*of*confidence. ... Observe that all points

*in*

*a*model agree on the truth value

*of*every completely modalized

*formula*. Hence, for such

*formulae*the notions

*of*

*satisfaction*

*and*truth

*in*

*a*model coincide. ...

##
###
Augmenting tractable fragments of abstract argumentation

2012
*
Artificial Intelligence
*

We present

doi:10.1016/j.artint.2012.03.002
fatcat:zi5kasv7ufej3cxgxswvjkrk4i
*a*new approach to the efficient solution*of*important computational problems that arise*in*the context*of*abstract argumentation. ... Other tractable fragments such as the fragments*of**symmetrical**and*bipartite frameworks seem to prohibit an augmentation: the acceptance problems are already intractable for frameworks at distance 1 from ... Acknowledgements We thank the anonymous reviewers for their valuable suggestions that helped to improve the presentation*of*the paper. ...##
###
Theorem Proving and Algebra
[article]

2021
*
arXiv
*
pre-print

This book can be seen either as

arXiv:2101.02690v2
fatcat:2unv7ebr7zdprpjrcme5pmgkvi
*a*text on theorem proving that uses techniques from general algebra, or else as*a*text on general algebra illustrated*and*made concrete by practical exercises*in*theorem ... However, we do emphasize equational logic,*and*for simplicity we use only the OBJ3 software system, though it is used*in**a*rather flexible manner. ... However, we will show that explicit*quantifiers*E9 are necessary for an adequate*treatment**of**satisfaction*. ...##
###
Consistent document engineering

2003
*
Proceedings of the 2003 ACM symposium on Document engineering - DocEng '03
*

Also, I would like to Introductory Survey It proposes changes to one

doi:10.1145/958243.958246
fatcat:sf237xsgabgbtemnscvzxiaql4
*of*the variables k or d,*in*order to invert the truth value*of*k = key(d), if its*boolean*result is False. ... The hint for the atomic*formula*dId(m) = kId(d) sets the field dId*of*the manual m only; we would never change the key definition d*in*case dId(m) = kId(d) is violated. ... Our incremental algorithm deviates from brute force*evaluation*mostly*in*the*treatment**of**quantified**formulae*. • Due to miniscoping, only atomic*formulae*can appear*in**a*negated context. ...##
###
Computational Complexity of Deciding Provability in Linear Logic and its Fragments
[article]

2021
*
arXiv
*
pre-print

*A*central problem

*of*the logic is the question whether

*a*given list

*of*

*formulas*is provable with the calculus. ... We prove an original complexity characterization

*of*

*a*fragment

*of*the logic

*and*present ideas for

*a*new, structural approach to the examination

*of*provability

*in*linear logic. ... We prove this by reduction from QBF

*in*two major steps: • We show that the

*evaluation*

*of*

*quantifier*-free

*Boolean*functions can be simulated by cut-free proof search

*in*MALL. • We then show that the

*evaluation*...

##
###
Possibility Theory and Its Applications: Where Do We Stand?
[chapter]

2015
*
Springer Handbook of Computational Intelligence
*

Shackle also introduces

doi:10.1007/978-3-662-43505-2_3
fatcat:qptvfae6hndopkvagiwlsnxaxu
*a*notion*of*conditional possibility, whereby the degree*of*surprise*of**a*conjunction*of*two events*A**and*B is equal to the maximum*of*the degree*of*surprise*of**A*,*and**of*the degree ... Possibility theory lies at the crossroads between fuzzy sets, probability*and*non-monotonic reasoning. Possibility theory can be cast either*in*an ordinal or*in**a*numerical setting. ... On the other hand,*a*possibilistic*treatment**of*uncertainty*and*exceptions can be performed on top*of**a*description logic*in**a*possibilistic logic style [105] . ...##
###
Fusion: General concepts and characteristics

2001
*
International Journal of Intelligent Systems
*

Finally we briefly discuss the difficult aspects

doi:10.1002/int.1052
fatcat:pdowlalbzbdenoum2m2sm7z5hi
*of*validation*and**evaluation*. ... We first present different types*of*information encountered*in*fusion problems,*and*different aims*of*the fusion process. ... For instance,*in*expert opinion pooling, it means the calibration*of*experts for*evaluating*their faithfulness*and*their tendency*toward*overconfidence. ...
« Previous

*Showing results 1 — 15 out of 447 results*