Information and Computation
Knowledge compilation = query rewriting + view synthesis
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Proceedings of the 2004 ACM symposium on Applied computing
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Translating datalog-like optimization queries into ILOG programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
Two logical hierarchies of optimization problems over the real numbers
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Implementation and experimentation of the logic language NP Datalog
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Survey: A survey on the structure of approximation classes
Computer Science Review
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
| Hi-index | 0.00 |