Skip to search formSkip to main contentSkip to account menu

Journal of Automated Reasoning

The Journal of Automated Reasoning was established in 1983 by Larry Wos who was its editor in chief until 1992. It covers research and advances in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Automated reasoningComputer scienceMizarScopus

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Polynomial Constraint Solving over Finite Domains with the Modified Bernstein Form
This paper describes an algorithm that can be used to effectively solve polynomial constraints over finite domains. Such… 
2015
2015
C-Clause Calculi and Refutation Search in First-Order Classical Logic
The paper describes an approach to the construction of a resolution-type technique basing on a certain generalization of the… 
2013
2013
Formal Verification of Voting and Auction Protocols : From Privacy to Fairness and Verifiability
In this document, we formally analyze security in electronic voting and electronic auctions. On-line voting over is now available… 
2012
2012
Towards a concurrency theory for supervisory control
In this paper we propose a process-theoretic concurrency model to express supervisory control properties. In light of the present… 
2007
2007
On the Distinction between Relational and Functional Type Theory
It is commonly believed that it makes no difference whether one starts with relational types or functional types in formulating… 
2004
2004
Special issue on First-Order Theorem Proving of the Journal of Automated Reasoning
This special issue of the Journal of Automated Reasoning (JAR) is devoted to First-order Theorem Proving, a core domain of… 
2002
2002
Diseño y resolución interactiva de ejercicios que involucren cálculo simbólico
La tesis que se presenta describe MathEdu, una herramienta para el diseno y resolucion interactiva de ejercicios que involucren… 
Review
1999
Review
1999
Extending the Computational Horizon: Effective Distributed Resource-Bounded Computation for Intractable Problems
A number of combinatorial problems of interest to computational economists, such as some two-sided matching problems, belong to… 
1997
1997
Minimal and Complete Prefix Unification for Non-Classical Theorem Proving
For theorem proving in non-classical logics two similar ap- proaches have been established: a matrix characterization of Wallen… 
1996
1996
Bottom-Up Query Evaluation in Extended Deductive Databases
Semantics Many concrete semantics have been defined by selecting either a specific model of every logic program (such as the well… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)