Results 131 to 140 of about 307,150 (181)

Counting Subnetworks Under Gene Duplication in Genetic Regulatory Networks. [PDF]

Bull Math Biol
Scruse A, Arnold J, Robinson R.
europepmc   +1 more source

Autocatalytic cores in the diluted regime: classification and properties. [PDF]

J Math Biol
Nandan P, Nghe P, Unterberger J.
europepmc   +1 more source

Error Resilient Space Partitioning. [PDF]

Discrete Comput Geom
Dunkelman O, Geyzel Z, Keller C, Keller N, Ronen E, Shamir A, Tessler RJ.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Refutational theorem proving for hierarchic first-order theories

Applicable Algebra in Engineering, Communication and Computing, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bachmair, L., Ganzinger, H., Waldmann, U. ; https://orcid.org/0000-0002-0676-7195   +2 more
openaire   +4 more sources

Machine Learning for First-Order Theorem Proving

Journal of Automated Reasoning, 2014
James P. Bridge, Sean B. Holden, Lawrence C. Paulson   +2 more
openaire   +3 more sources

Theorem proving for hierarchic first-order theories

2005
We extend previous results on theorem proving for first-order clauses with equality to hierarchic first-order theories. Semantically such theories are confined to conservative extensions of the base models. It is shown that superposition together with variable abstraction and constraint refutation is refutationally complete for sufficiently complete ...
Bachmair, L., Ganzinger, H., Waldmann, U. ; https://orcid.org/0000-0002-0676-7195   +2 more
openaire   +2 more sources

Well-Behaved Inference Rules for First-Order Theorem Proving

Journal of Automated Reasoning, 1998
Boolean ring based deduction was introduced independently by Jieh Hsiang in 1982, and by Deepak Kapur and Paliath Narendran in 1985. The Boolean ring has ``exclusive OR'' as addition operator, and ``AND'' as multiplication operator, and its main advantage is a canonical rewrite system, so that every expression has unique normal form.
Wu, J., Liu, Z.
openaire   +3 more sources

Comparing Unification Algorithms in First-Order Theorem Proving

2009
Unification is one of the key procedures in first-order theorem provers. Most first-order theorem provers use the Robinson unification algorithm. Although its complexity is in the worst case exponential, the algorithm is easy to implement and examples on which it may show exponential behaviour are believed to be atypical. More sophisticated algorithms,
Hoder, Kryštof, Voronkov, Andrei
openaire   +2 more sources