Towards automated deduction in cP systems

DOI10.1016/J.INS.2021.12.035OpenAlexW4200439499MaRDI QIDQ6154793FDOQ6154793

Authors: Yezhou Liu, Radu Nicolescu, Jing Sun 

Publication date: 16 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.12.035

Recommendations

• Sublinear P system solutions to NP-complete problems
• Formal verification of cP systems using Coq
• Computational complexity of tissue-like P systems
• P systems with active membranes operating under minimal parallelism
• scientific article; zbMATH DE number 1735634

zbMATH Keywords

membrane computingP systemsautomated deductionKnuth-Bendix completioncP systems

Mathematics Subject Classification ID

Quantum theory (81-XX) Computer science (68-XX)

Cites Work

• Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
• Computing with membranes
• Isabelle. A generic theorem prover
• Tissue P systems.
• Spiking neural P systems
• Formal verification of cP systems using PAT3 and ProB
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• Complete Sets of Reductions for Some Equational Theories
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• Completion for multiple reduction orderings
• Multi-completion with termination tools
• Multi-completion with Termination Tools (System Description)
• Title not available (Why is that?)
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• P systems with active membranes: Attacking NP-complete problems
• Solving HPP and SAT by P systems with active membranes and separation rules
• Title not available (Why is that?)
• 3-Col problem modelling using simple kernel P systems
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• Refutational theorem proving using term-rewriting systems
• Title not available (Why is that?)
• Rewrite method for theorem proving in first order theory with equality
• Unification theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving a PSPACE-complete problem with cP systems
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• Programming P Systems with Complex Objects
• A sublinear Sudoku solution in cP systems and its formal verification
• Orienting rewrite rules with the Knuth-Bendix order.
• An efficient labelled nested multiset unification algorithm
• The term rewriting approach to automated theorem proving
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Towards automated deduction in cP systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154793)