Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Explicit versus implicit representations of subsets of the Herbrand universe
Theoretical Computer Science
Negation Elimination from Simple Equational Formulae
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Solving Equational Problems Efficiently
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Information and Computation
On the complexity of equational problems in CNF
Journal of Symbolic Computation - Special issue: First order theorem proving
Constructive negation by bottom-up computation of literal answers
Proceedings of the 2004 ACM symposium on Applied computing
ACM Transactions on Computational Logic (TOCL)
The first order theory of primal grammars is decidable
Theoretical Computer Science
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic
Journal of Automated Reasoning
Stratified type inference for generalized algebraic data types
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 2006 ACM symposium on Applied computing
A constraint-based approach to guarded algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theory and Practice of Logic Programming
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Electronic Notes in Theoretical Computer Science (ENTCS)
Theory of finite or infinite trees revisited
Theory and Practice of Logic Programming
A Full First-Order Constraint Solver for Decomposable Theories
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
From exponential to almost linear decomposability of finite or infinite trees
Proceedings of the 2009 ACM symposium on Applied Computing
A full first-order constraint solver for decomposable theories
Annals of Mathematics and Artificial Intelligence
Solving first-order constraints in the theory of the evaluated trees
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Solving first-order constraints in the theory of the evaluated trees
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Equational constraint solving via a restricted form of universal quantification
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Model representation via contexts and implicit generalizations
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A complete axiomatization of strict equality
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
XML query-update independence analysis revisited
Proceedings of the 2012 ACM symposium on Document engineering
Hi-index | 0.00 |