Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Linear time datalog and branching time logic
Logic-based artificial intelligence
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
An incremental algorithm for generating all minimal models
Artificial Intelligence
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
The divide-and-conquer subgoal-ordering algorithm for speeding up logic inference
Journal of Artificial Intelligence Research
An incremental algorithm for generating all minimal models
Artificial Intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
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
Model-based Runtime Verification Framework for Self-optimizing Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
A practical generic privacy language
ICISS'10 Proceedings of the 6th international conference on Information systems security
Comprehensive verification framework for dependability of self-optimizing systems
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A Methodology For Constructing Logic Programs
Fundamenta Informaticae
A decomposition method for CNF minimality proofs
Theoretical Computer Science
| Hi-index | 0.00 |