Sciweavers

1059 search results - page 127 / 212
» Standard Logics Are Valuation-Nonmonotonic
Sort
View
MST
2006
120views more  MST 2006»
13 years 10 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
ICFEM
2009
Springer
13 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 5 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
JUCS
2007
121views more  JUCS 2007»
13 years 10 months ago
Semantic-based Skill Management for Automated Task Assignment and Courseware Composition
Abstract: Knowledge management is characterized by many different activities ranging from the elicitation of knowledge to its storing, sharing, maintenance, usage and creation. Sk...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
AIML
2004
13 years 11 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou