Sciweavers

FUIN
2010
93views more  FUIN 2010»
13 years 2 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
LOGCOM
1998
122views more  LOGCOM 1998»
13 years 4 months ago
Adding the Everywhere Operator to Propositional Logic
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
David Gries, Fred B. Schneider
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 4 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 4 months ago
On Modal Logics of Partial Recursive Functions
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
Pavel Naumov
ECAI
2010
Springer
13 years 5 months ago
Majority Merging: from Boolean Spaces to Affine Spaces
Abstract. This paper is centered on the problem of merging (possibly conflicting) information coming from different sources. Though this problem has attracted much attention in pro...
Jean-François Condotta, Souhila Kaci, Pierr...
AAAI
1997
13 years 5 months ago
Ordered Semantic Hyper Linking
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
David A. Plaisted, Yunshan Zhu
IJCAI
2003
13 years 5 months ago
Quantifying information and contradiction in propositional logic through test actions
Degrees of information and of contradiction are investigated within a uniform propositional framework, based on test actions. We consider that the degree of information of a propo...
Sébastien Konieczny, Jérôme La...
FLAIRS
2007
13 years 6 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
CAV
2003
Springer
107views Hardware» more  CAV 2003»
13 years 9 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
AIIA
2005
Springer
13 years 10 months ago
Mining Relational Association Rules for Propositional Classification
In traditional classification setting, training data are represented as a single table, where each row corresponds to an example and each column to a predictor variable or the targ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba