Results 41 to 50 of about 307,150 (181)
The Modal μ-Calculus Hierarchy on Restricted Classes of Transition Systems [PDF]
, 2009 We discuss the strictness of the modal µ-calculus hierarchy over some restricted classes of transition systems. First, we show that the hierarchy is strict over reflexive frames.
Alberucci, L., Facchini, A.
core +2 more sources
Splitting Proofs for Interpolation
, 2017 We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon signature ...
A Cimatti +14 more
core +2 more sources
Symmetries and conservation laws in the Gunther k-symplectic formalism of field theory [PDF]
, 2007 This paper is devoted to studying symmetries of k-symplectic Hamiltonian and Lagrangian first-order classical field theories. In particular, we define symmetries and Cartan symmetries and study the problem of associating conservation laws to these ...
Abraham R. A. +11 more
core +4 more sources
Paramodulation and Theorem-proving in First-Order Theories with Equality [PDF]
, 1983 A term is an individual constant or variable or an n-adic function letter followed by n terms. An atomic formula is an n-adic predicate letter followed by n terms. A literal is an atomic formula or the negation thereof. A clause is a set of literals and is thought of as representing the universally-quantified disjunction of its members.
Robinson, G., Wos, L.
openaire +2 more sources
New results on rewrite-based satisfiability procedures
, 2007 Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T.
Alessandro Armando +51 more
core +9 more sources
Universality of the minimum modulus for random trigonometric polynomials
Discrete Analysis, 2021 Universality of the minimum modulus for random trigonometric polynomials, Discrete Analysis 2021:20, 46 pp. This paper belongs to a long tradition of study of the behaviour of random polynomials that goes back at least to Littlewood.
Nicholas A. Cook, Hoi Nguyen
doaj +1 more source
On the solvability of systems of pseudodifferential operators [PDF]
, 2008 The paper studies the solvability for square systems of pseudodifferential operators. We assume that the system is of principal type, i.e., the principal symbol vanishes of first order on the kernel.
Dencker, Nils
core +2 more sources
Nonlinear AnalysisWe prove a hybrid fixed point theorem for the product of two operators in a latticeordered Banach algebra and apply to nonlinear hybrid quadratic integral equations of mixed type for proving the existence of maximal and minimal positive integrable ...
Janhavi B. Dhage +2 more
doaj +1 more source
A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Automated theorem provers have traditionally relied on manually tuned heuristics to guide how they perform proof search. Deep reinforcement learning has been proposed as a way to obviate the need for such heuristics, however, its deployment in automated theorem proving remains a challenge.
Crouse, Maxwell +9 more
openaire +2 more sources
A Contradiction Separation Dynamic Deduction Algorithm Based on Optimized Proof Search
International Journal of Computational Intelligence Systems, 2019 Most of the advanced first-order logic automated theorem proving (ATP) systems adopt binary resolution methods as the core inference mechanism, where only two clauses are involved and a complementary pair of literals are eliminated during each deduction ...
Feng Cao +4 more
doaj +1 more source