Sciweavers

825 search results - page 27 / 165
» Modal Logics with Counting
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
13 years 7 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
ICTAC
2005
Springer
14 years 1 months ago
An SLD-Resolution Calculus for Basic Serial Multimodal Logics
Abstract. We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, ...
Linh Anh Nguyen
JSYML
2002
170views more  JSYML 2002»
13 years 7 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
MLQ
2008
103views more  MLQ 2008»
13 years 7 months ago
On contraction and the modal fragment
We observe that removing contraction from a standard sequent calculus for first-order predicate logic preserves completeness for the modal fragment.
Kai Brünnler, Dieter Probst, Thomas Studer
SAT
2005
Springer
145views Hardware» more  SAT 2005»
14 years 1 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman