Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 33 results in range #1 to #33.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. The 481 Ways to Split a Clause and Deal with Propositional Variables: Label: en
  2. bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR: Label: en
  3. InKreSAT: Modal Reasoning via Incremental Reduction to SAT: Label: en
  4. Propositional Temporal Proving with Reductions to a SAT Problem: Label: en
  5. TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism: Label: en
  6. E-MaLeS 1.1: Label: en
  7. Automating Inductive Proofs Using Theory Exploration: Label: en
  8. Quantifier Instantiation Techniques for Finite Model Finding in SMT: Label: en
  9. Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems: Label: en
  10. Verifying Refutations with Extended Resolution: Label: en
  11. Temporalizing Ontology-Based Data Access: Label: en
  12. Dynamic Logic with Trace Semantics: Label: en
  13. Reuse in Software Verification by Abstract Method Calls: Label: en
  14. Towards Modularly Comparing Programs Using Automated Theorem Provers: Label: en
  15. An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description: Label: en
  16. PRocH: Proof Reconstruction for HOL Light: Label: en
  17. Hierarchical Combination: Label: en
  18. Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis: Label: en
  19. Solving Difference Constraints over Modular Arithmetic: Label: en
  20. dReal: An SMT Solver for Nonlinear Theories over the Reals: Label: en
  21. A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition: Label: en
  22. Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals: Label: en
  23. Foundational Proof Certificates in First-Order Logic: Label: en
  24. Automated Reasoning, Fast and Slow: Label: en
  25. Analysing Vote Counting Algorithms via Logic: Label: en
  26. System Description: E-KRHyper 1.4: Label: en
  27. Computing Tiny Clause Normal Forms: Label: en
  28. Tractable Inference Systems: An Extension with a Deducibility Predicate: Label: en
  29. A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies: Label: en
  30. Completeness and Decidability Results for First-Order Clauses with Indices: Label: en
  31. Hierarchic Superposition with Weak Abstraction: Label: en
  32. The Tree Width of Separation Logic with Recursive Definitions: Label: en
  33. One Logic to Use Them All: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)