An infinite hierarchy of temporal logics over branching time
Information and Computation
Representing Epistemic Uncertainty by Means of Dialectical Argumentation
Annals of Mathematics and Artificial Intelligence
Quantifier Rank for Parity of Embedded Finite Models
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Interpolation Theorems for Nonmonotonic Reasoning Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Hybrid Systems with Finite Bisimulations
Hybrid Systems V
An Annotated Corpus and a Grammar Model of Theorem Description
MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management
Quantifier rank for parity of embedded finite models
Theoretical Computer Science - Mathematical foundations of computer science
Model-theoretic semantics for the web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Countable ultrahomogeneous antimatroids of convex dimension 2
Discrete Mathematics
Business artifacts: An approach to operational specification
IBM Systems Journal
An incremental algorithm for DLO quantifier elimination via constraint propagation
Artificial Intelligence
An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Grounded Conceptual Graph Models
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Quantified Positive Temporal Constraints
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Homogeneous and strictly homogeneous criteria for partial structures
Discrete Applied Mathematics
Maximal infinite-valued constraint languages
Theoretical Computer Science
Semilinear Program Feasibility
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Automated deduction for verification
ACM Computing Surveys (CSUR)
Representing metadata constraints in Common Logic
International Journal of Metadata, Semantics and Ontologies
Theoretical Computer Science
Logical queries over views: Decidability and expressiveness
ACM Transactions on Computational Logic (TOCL)
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
A Mathematical Model of Dialog
Electronic Notes in Theoretical Computer Science (ENTCS)
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Characterizing schema mappings via data examples
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Advanced modelling made simple with the Gmodel metalanguage
Proceedings of the First International Workshop on Model-Driven Interoperability
Distance constraint satisfaction problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Descendant-homogeneous digraphs
Journal of Combinatorial Theory Series A
A formal quantifier elimination for algebraically closed fields
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Homomorphisms and chains of Kripke models
Archive for Mathematical Logic
Theories of initial segments of standard models of arithmetics and their complete extensions
Theoretical Computer Science
Automated search for impossibility theorems in social choice theory: ranking sets of objects
Journal of Artificial Intelligence Research
Characterizing schema mappings via data examples
ACM Transactions on Database Systems (TODS)
Quantified Equality Constraints
SIAM Journal on Computing
The complexity of equality constraint languages
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On hierarchical reasoning in combinations of theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
RCC8 is polynomial on networks of bounded treewidth
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax
Journal of Automated Reasoning
Countable homogeneous linearly ordered posets
European Journal of Combinatorics
On the tarski-lindenbaum algebra of the class of all strongly constructivizable prime models
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Qualitative temporal and spatial reasoning revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Maximal infinite-valued constraint languages
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Syntactically characterizing local-to-global consistency in ORD-Horn
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Archive for Mathematical Logic
Verification of database-driven systems via amalgamation
Proceedings of the 32nd symposium on Principles of database systems
Enabledness-based program abstractions for behavior validation
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
A game-theoretic approach to fault diagnosis and identification of hybrid systems
Theoretical Computer Science
Constraint satisfaction tractability from semi-lattice operations on infinite sets
ACM Transactions on Computational Logic (TOCL)
Interpreting nowhere dense graph classes as a classical notion of model theory
European Journal of Combinatorics
| Hi-index | 0.00 |