Sciweavers

338 search results - page 37 / 68
» Many Facets of Complexity in Logic
Sort
View
JELIA
2010
Springer
13 years 7 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
TMC
2012
11 years 11 months ago
Compressed-Sensing-Enabled Video Streaming for Wireless Multimedia Sensor Networks
—This article1 presents the design of a networked system for joint compression, rate control and error correction of video over resource-constrained embedded devices based on the...
Scott Pudlewski, Arvind Prasanna, Tommaso Melodia
KES
2007
Springer
14 years 2 months ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato
IJCAI
2003
13 years 10 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov