Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,324 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Automated reasoning
Computer science
Mizar
Scopus
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Resolution Calculus for First-Order Logic
Anders Schlichtkrull
Arch. Formal Proofs
2016
Corpus ID: 29800750
This theory is a formalization of the resolution calculus for first-order logic. It is proven sound and complete. The soundness…
Expand
2015
2015
C-Clause Calculi and Refutation Search in First-Order Classical Logic
Alexander V. Lyaletski
International Conference on Information and…
2015
Corpus ID: 6920919
The paper describes an approach to the construction of a resolution-type technique basing on a certain generalization of the…
Expand
2013
2013
Formal Verification of Voting and Auction Protocols : From Privacy to Fairness and Verifiability
Jannik Dreier
2013
Corpus ID: 167157938
In this document, we formally analyze security in electronic voting and electronic auctions. On-line voting over is now available…
Expand
2012
2012
Towards a concurrency theory for supervisory control
J. Baeten
,
V. Hulst
,
V. Beek
,
J. Markovski
2012
Corpus ID: 56069114
In this paper we propose a process-theoretic concurrency model to express supervisory control properties. In light of the present…
Expand
2007
2007
On the Distinction between Relational and Functional Type Theory
P. Oppenheimer
,
E. Zalta
2007
Corpus ID: 14262485
It is commonly believed that it makes no difference whether one starts with relational types or functional types in formulating…
Expand
2005
2005
Recursive Path Orderings Can Also Be Incremental
M. F. Venero
,
Guillem Godoy
,
A. Rubio
Logic Programming and Automated Reasoning
2005
Corpus ID: 14572925
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called…
Expand
2002
2002
Diseño y resolución interactiva de ejercicios que involucren cálculo simbólico
F. Rubio
2002
Corpus ID: 169601199
La tesis que se presenta describe MathEdu, una herramienta para el diseno y resolucion interactiva de ejercicios que involucren…
Expand
2000
2000
Interaction entre symbolique et numérique : application à la vision artificielle. (Interaction between Symbolic and numerical Computation; Application to Computer Vision)
Didier Bondyfalat
2000
Corpus ID: 21183692
Les motivations initiales de ce travail proviennent de l'etalonnage de cameras en vision artificielle. Nous nous sommes surtout…
Expand
Review
1999
Review
1999
Extending the Computational Horizon: Effective Distributed Resource-Bounded Computation for Intractable Problems
Harry J. Paarsch
,
Alberto Maria Segre
1999
Corpus ID: 14139777
A number of combinatorial problems of interest to computational economists, such as some two-sided matching problems, belong to…
Expand
1996
1996
Bottom-Up Query Evaluation in Extended Deductive Databases
Stefan Brass
1996
Corpus ID: 17741617
Semantics Many concrete semantics have been defined by selecting either a specific model of every logic program (such as the well…
Expand
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)
ACCEPT & CONTINUE