Sciweavers

150 search results - page 14 / 30
» Complexity of the Unique Extension Problem in Default Logic
Sort
View
84
Voted
FORMATS
2008
Springer
14 years 11 months ago
Some Recent Results in Metric Temporal Logic
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
Joël Ouaknine, James Worrell
SIGMOD
1999
ACM
114views Database» more  SIGMOD 1999»
15 years 1 months ago
A Layered Architecture for Querying Dynamic Web Content
The design of webbases, database systems for supporting Webbased applications, is currently an active area of research. In this paper, we propose a 3-layer architecture for design...
Hasan Davulcu, Juliana Freire, Michael Kifer, I. V...
107
Voted
TPLP
2002
99views more  TPLP 2002»
14 years 9 months ago
Using Methods of Declarative Logic Programming for Intelligent Information Agents
At present, the search for specific information on the World Wide Web is faced with several problems, which arise on the one hand from the vast number of information sources avail...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
LICS
2008
IEEE
15 years 3 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
109
Voted
GPCE
2009
Springer
15 years 22 days ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen