Sciweavers

395 search results - page 63 / 79
» Decision Problems for Convex Languages
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
BIS
2010
227views Business» more  BIS 2010»
13 years 9 months ago
Using SPARQL and SPIN for Data Quality Management on the Semantic Web
The quality of data is a key factor that determines the performance of information systems, in particular with regard (1) to the amount of exceptions in the execution of business p...
Christian Fürber, Martin Hepp
ANLP
1992
170views more  ANLP 1992»
13 years 8 months ago
Automatic Extraction of Facts from Press Releases to Generate News Stories
While complete understanding of arbitrary input text remains in the future, it is currently possible to construct natural language processing systems that provide a partial unders...
Peggy M. Andersen, Philip J. Hayes, Steven P. Wein...
COMSIS
2007
80views more  COMSIS 2007»
13 years 7 months ago
"Security of Computer Systems and Networks" Book Preview
This paper presents preview of the new book titled “Security of Computer Systems and Networks” (original in Serbian language “Sigurnost računarskih sistema i mreža”) – ...
Dragan Pleskonjic, Nemanja Macek, Borislav Djordje...
JELIA
2010
Springer
13 years 6 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, ...