A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
2004
Journal of Logic and Computation
Preserved Fulltext
In this paper, we present a general framework for modelling limited reasoning based on approximate reasoning and discuss its properties. We start from Cadoli and Schaerf's approximate entailment. ...
A sound and complete formulation for this new system is given and its expressivity and control advantages are formally proved. ...
Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control 193 3. Expand the tableau until it is closed or stuck. 4. ...
doi:10.1093/logcom/14.2.179
fatcat:usworippyneptpnfa4gm6lfy3q
Temporal theories of reasoning
1995
Journal of Applied Non-Classical Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using temporal logic one can define theories and look at all models of that theory. ...
The examples indicate that partial temporal logic is a powerful means of describing and formalizing complex reasoning patterns, as the dynamic aspects of reasoning systems are integrated into the static ...
Acknowledgements: This work has been carried out in the context of SKBS and the ESPRIT III Basic Research project 6156 DRUMS II. ...
doi:10.1080/11663081.1995.10510845
fatcat:7asl6gtzi5h4vglrisnynxp6a4
Temporal theories of reasoning
1995
Journal of Applied Non-Classical Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using temporal logic one can define theories and look at all models of that theory. ...
The examples indicate that partial temporal logic is a powerful means of describing and formalizing complex reasoning patterns, as the dynamic aspects of reasoning systems are integrated into the static ...
Acknowledgements: This work has been carried out in the context of SKBS and the ESPRIT III Basic Research project 6156 DRUMS II. ...
doi:10.1080/11663081.1995.10510858
fatcat:yx2b2gdh6ffw7dz7mvvzd3lnt4
Reasoning about Recursive Quantum Programs
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
data and probabilistic control. ...
However, there are as yet no general methods for reasoning about (mutual) recursive procedures and ancilla quantum data structure in quantum computing (with measurement). ...
A semantical basis of (exact) probabilistic reasoning can be adapted from Eq. (3) with = in place of ≤ (for approximate reasoning). ...
arXiv:2107.11679v1
fatcat:eocby6agm5a6bdfhdeufsiv4fu
Reasoning about Java classes
1998
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We u s e o u r o wn front-end tool (which is still partly under construction) for translating Java classes into logic, and a back-end theorem prover (namely PVS, developed at SRI) for reasoning. ...
In several examples we will demonstrate how nontrivial properties of Java programs and classes can be proved following this two-step approach. ...
An assertional approach (as used by s u c h a proof tool, or possibly also by someone reasoning by hand) has a de nite advantage over testing: by testing one only checks a limited number of cases 1 . ...
doi:10.1145/286936.286973
dblp:conf/oopsla/JacobsBHB98
fatcat:yp4q2bnfxfgz5l2gw3seufme6m
Reasoning about Java classes
1998
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We u s e o u r o wn front-end tool (which is still partly under construction) for translating Java classes into logic, and a back-end theorem prover (namely PVS, developed at SRI) for reasoning. ...
In several examples we will demonstrate how nontrivial properties of Java programs and classes can be proved following this two-step approach. ...
An assertional approach (as used by s u c h a proof tool, or possibly also by someone reasoning by hand) has a de nite advantage over testing: by testing one only checks a limited number of cases 1 . ...
doi:10.1145/286942.286973
fatcat:onfrbbe4hjbitk6c4jb6azxmiu
Reasoning algebraically about recursion
1992
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The algebraic style gives rise to elegant proofs, although the requirement of existence of weak-op-inverse may limit applicability. ...
Gardiner, P.H.B. and P.K. Pandya, Reasoning algebraically about recursion, Science of Computer Programming 18 (1992) 271-280. ...
Hoare for his advise and encouragement during this work. We also thank Carroll Morgan and Jifeng He for their helpful comments. ...
doi:10.1016/0167-6423(92)90019-8
fatcat:wlnalupid5fjznbdpebem6aisa
Reasoning with power defaults
2004
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In particular, we get the property of being able to reason by cases, and the so-called law of cautious monotony. ...
, and Magidor. ...
function as they evolve under the iteration controlled by a program. ...
doi:10.1016/j.tcs.2004.04.008
fatcat:asaod3bdo5fatozibqkaxvxnp4
Tractable reasoning via approximation
1995
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our main goal is to define a semantically well-founded logic for approximate reasoning, which is justifiable from the intuitive point of view, and to provide fast algorithms for dealing with it even when ...
using expressive languages. ...
Luigia Carlucci Aiello, Maurizio Lenzerini and Andrea Schaerf carefully read and commented previous versions of this paper. ...
doi:10.1016/0004-3702(94)00009-p
fatcat:xaqk5gs3vjffhgnrh53dru56cq
Abductive Reasoning: Challenges Ahead
2009
THEORIA : an International Journal for Theory, History and Fundations of Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
the best explanation and as a process of epistemic change. ...
The purpose of this piece is to provide a critical analysis on some key aspects of abduction, as conceived by several researchers through my book Abductive Reasoning. ...
In particular, in their contribution "Abduction through Semantic Tableaux versus Abduction through Goal-Directed Proofs", Joke Meheus and Dagmar Provijn propose a calculi of such kind. ...
doi:10.1387/theoria.446
doaj:e7f7025a69584860b0976cb940a097e6
fatcat:wtdp5hzd7fc2rpeqgdwcccmgeq
Mechanical Reasoning about Families of UTP Theories
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a semantic embedding of Hoare and He's Unifying Theories of Programming (UTP) framework into the ProofPower-Z theorem prover; it concisely captures the notion of UTP theory, theory ...
We show how the encoding can be used to reason about UTP theories and their predicates, including models of particular specifications and programs. ...
Acknowledgement Valuable discussions have taken place with Marcel Oliveira regarding his original encoding, experience with proofs, and possible ways to overcome the inconsistency that was first pointed ...
doi:10.1016/j.entcs.2009.05.055
fatcat:jckuq43x7bem7jcm7wamrrqfiq
Mechanical reasoning about families of UTP theories
2012
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show how the encoding can be used to reason about UTP theories and their predicates, including models of particular specifications and programs. ...
We also create structuring mechanisms that support the incremental construction and reuse of encoded theories, associated laws and proof tactics. ...
Acknowledgements Valuable discussions have taken place with Marcel Oliveira regarding his original encoding, experience with mechanical proofs, and possible ways to overcome the inconsistency issue that ...
doi:10.1016/j.scico.2010.02.010
fatcat:skbvh7ezzbhgnex66oecdctgjm
A Logic for Approximate First-Order Reasoning
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The procedure yields approximate proofs whose precision increases as the reasoner has more resources at her disposal. ...
The logic is semantically founded on the notion of resource, an accuracy measure, which controls at the same time the two barriers of complexity. ...
These criteria are under study and we hope that an intelligent control strategy will be possible for approximate first-order reasoning. ...
doi:10.1007/3-540-44802-0_19
fatcat:zd5tulhvnneyzmkxjwdvvs4kuq
Foundations of fuzzy reasoning
1976
International Journal of Man-Machine Studies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper gives an overview of the theory of fuzzy sets and fuzzy reasoning as proposed and developed by Lotfi Zadeh. ...
The paradoxes of the barber, and of sorites, are then analysed to illustrate fuzzy reasoning in action and lead naturally to Zadeh's theory of linguistic hedges and truth. ...
In the more modern context of control theory and practice cited above, consider a study in "control engineering". ...
doi:10.1016/s0020-7373(76)80027-2
fatcat:x4gxxshdubdvtplgfrgq4poiqu
Relational Reasoning about Contexts
1997
BRICS Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper we study applicative bisimulation and a variant of Sands' improvement theory for a small call-by-value functional language. ...
Previous operational proofs of these results involve complex, explicit reasoning about contexts. ...
Finally, I am indebted to Andrew Gordon, Peter Ørbaek and an anonymous referee for detailed comments and helpful suggestions. ...
doi:10.7146/brics.v4i24.18950
fatcat:bcgjabmqkrghlntug6ytondvkq
« Previous
Showing results 1 — 15 out of 28,713 results