Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
On functional dependencies in q-Horn theories
Artificial Intelligence
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Linear time datalog and branching time logic
Logic-based artificial intelligence
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
A uniform framework for regulating service access and information release on the web
Journal of Computer Security
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
IEEE Transactions on Knowledge and Data Engineering
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
Model-Based Diagnosis or Reasoning from First Principles
IEEE Intelligent Systems
Log Auditing through Model-Checking
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Logic-based web information extraction
ACM SIGMOD Record
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Conjunctive queries over trees
Journal of the ACM (JACM)
Generalized domination in closure systems
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
Artificial Intelligence
Towards Automated Online Diagnosis of Robot Navigation Software
SIMPAR '08 Proceedings of the 1st International Conference on Simulation, Modeling, and Programming for Autonomous Robots
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Recent Advances in Constraints
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Efficient datalog abduction through bounded treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Generalized domination in closure systems
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Diagnosing dependent failures in the hardware and software of mobile autonomous robots
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
Using AI techniques for fault localization in component-oriented software systems
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Worst case bounds for some NP-Complete modified Horn-SAT problems
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A non-iterative data-flow algorithm for computing liveness sets in strict SSA programs
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Query induction with schema-guided pruning strategies
The Journal of Machine Learning Research
The route to success: a performance comparison of diagnosis algorithms
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Abstract Hilbertian deductive systems, infon logic, and Datalog
Information and Computation
A decomposition method for CNF minimality proofs
Theoretical Computer Science
| Hi-index | 0.89 |