Ngā hua rapu - "symbolic computation"
Ngā kaupapa kua whakahuatia i roto i tō rapu.
Ngā kaupapa kua whakahuatia i roto i tō rapu.
- History of engineering & technology 3
- Artificial Intelligence 1
- Artificial intelligence 1
- Computer Science Logic and Foundations of Programming 1
- Computer science 1
- Formal Languages and Automata Theory 1
- Machine theory 1
- Mathematics & science 1
- Research & information: general 1
- Software Engineering 1
- Software engineering 1
-
1
Numerical and Symbolic Computation Developments and Applications
I whakaputaina 2020Ngā marau: “…symbolic computation…”
DOAB: download the publication
DOAB: description of the publication
Tāhiko Wāhanga pukapuka -
2
Numerical and Symbolic Computation Developments and Applications
I whakaputaina 2020DOAB: download the publication
DOAB: description of the publication
Tāhiko Wāhanga pukapuka -
3
Applied and Computational Mathematics for Digital Environments
I whakaputaina 2023Ngā marau: “…symbolic computation…”
DOAB: download the publication
DOAB: description of the publication
Tāhiko Wāhanga pukapuka -
4
Symmetry in Applied Continuous Mechanics
I whakaputaina 2020Ngā marau: “…symbolic computation…”
DOAB: download the publication
DOAB: description of the publication
Tāhiko Wāhanga pukapuka -
5
Calculus and Digital Natives in Rendezvous: <i>wxMaxima</i> Impact
I whakaputaina 2021Connect to this object online.
Pukapuka -
6
Automated Deduction - CADE 29 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023, Proceedings /
I whakaputaina 2023Rārangi ihirangi: “…Certified Core-Guided MaxSAT Solving -- Superposition with Delayed Unification -- On Incremental Pre-processing for SMT -- Verified Given Clause Procedures -- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment -- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs -- An Isabelle/HOL Formalization of the SCL(FOL) Calculus -- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning -- Formal Reasoning about Influence in Natural Sciences Experiments -- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification) -- SAT-Based Subsumption Resolution -- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper) -- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) -- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description) -- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT -- Proving Termination of C Programs with Lists -- Reasoning about Regular Properties: A Comparative Study -- Program Synthesis in Saturation -- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus -- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs -- Verification of NP-hardness Reduction Functions for Exact Lattice Problems -- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic -- Left-Linear Completion with AC Axioms -- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+ -- Theorem Proving in Dependently-Typed Higher-Order Logic -- Towards Fast Nominal Anti-Unification of Letrec-Expressions -- Confluence Criteria for Logically Constrained Rewrite Systems -- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory -- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper) -- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness -- Decidability of difference logic over the reals with uninterpreted unary predicates -- Incremental Rewriting Modulo SMT -- Iscalc: an Interactive Symbolic Computation Framework (System Description).…”
Link to Metadata
Tāhiko īPukapuka -
7
-
8