Sciweavers

746 search results - page 4 / 150
» Connectionist Propositional Logic
Sort
View
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 6 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
DAGSTUHL
2008
13 years 7 months ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb
IJCAI
1997
13 years 7 months ago
A Four-Valued Fuzzy Propositional Logic
It is generally accepted that knowledge based systems would be smarter and more robust if they can manage inconsistent, incomplete or imprecise knowledge. This paper is about a fo...
Umberto Straccia
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 6 months ago
Anytime Approximations of Classical Logic from Above
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
Marcelo Finger, Renata Wassermann
IGPL
2000
129views more  IGPL 2000»
13 years 6 months ago
Embeddings of Propositional Monomodal Logics
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced,...
Evgeni E. Zolin