725 search results - page 32 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
129
Voted
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
144
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
151
click to vote
PODC
1990
ACM
15 years 6 months ago
1990
ACM
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
122
click to vote
AAAI
2007
15 years 4 months ago
2007
This paper presents a new approach for merging prioritized knowledge bases in possibilistic logic. Our approach is semantically defined by a model-based merging operator in propo...
120
Voted
PODS
2010
ACM
15 years 2 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...