Theorem Proving
Robust Computer Algebra, Theorem Proving, and Oracle AI
... and theorem proving as a function of hardware resources: The premise of the analysis presented above is that CASs (and in- tegrated theorem proving) are likely to remain suffi- ciently ...
12
Normal Form Theorem Proving for the Lambek Calculus
... Normal Form Theorem Proving for the Lambek Calculus N o r m a l F o r m T h e o r e m P r o v i n g f o r t h e L a m b e k C a l c u l u s ~ M a r k H e p p l e C e n t r e f o r C o g n i t i v e S[.] ...
6
Applications of real number theorem proving in PVS
... number theorem proving, with applications to real world problems in engineering and design verification in ...the theorem prover PVS over recent years, some presented here for the first time, and ...
24
ARCH-COMP19 Category Report: Hybrid Systems Theorem Proving
... Systems Theorem Proving (HSTP) category in the ARCH-COMP Friendly Competition ...of theorem proving, HSTP again accommodates three modes: A) Automatic in which the entire verification is ...
21
ARCH-COMP18 Category Report: Hybrid Systems Theorem Proving
... Systems Theorem Proving (HSTP) as a new category in the ARCH-COMP Friendly Competition ...of theorem proving, HSTP is able to accomodate three modes: A) Automatic in which the entire ...
18
An Architecture for Voice Dialog Systems Based on Prolog Style Theorem Proving
... The reader should note in this continued interaction the m a n n e r in which the theorem proving drives the dialog and the user model inhibits or enables voice interactions appropriate [r] ...
40
The complexity of theorem proving in autoepistemic logic
... These results are interesting to compare with previous findings for default logic—another principal approach in nonmonotonic logic. In a wider attempt to a proof-theoretic formalisation of nonmonotic logics, Bonatti and ...
14
Symmetric Temporal Theorem Proving
... A Symmetric system is a system comprising of some identical processes. These systems contain some identical tasks that are the same for all iden- tical processes. A symmetric system often satisfies a set of properties; ...
37
Theorem proving for all: equational reasoning in Liquid Haskell
... Equational reasoning is one of the key features of pure func- tional languages such as Haskell. To date, however, such rea- soning always took place externally to Haskell, either manu- ally on paper, or mechanised in a ...
13
Automated theorem proving for mathematics : real analysis in PVS
... tertre’s theory co n tin uou s,fu nc tio ns described in Section 4.3.3. The functions this strategy can handle are those constructed using identity and constant functions, and the following combinations: — (unary and ...
169
Theorem recycling for Theorem Proving
... We conjecture that polynomial time decidable fragments of integer linear arithmetic are generally amenable to elementary conversions from real solutions to either integer solutions or po[r] ...
8
Brigitte Pientka. Programming Languages, Verification, Automated Theorem Proving, Logical Frameworks, Logic, Type Theory, Logic Programming
... Memoization-based proof search in LF: an experimental evaluation of a prototype First International Joint Conference on Automated Reasoning, Siena, Italy, Jun 2001 Termination and reduct[r] ...
7
The complexity of theorem proving in circumscription and minimal entailment
... Prior to this paper, very little was known about the proof complexity of propositional circumscription. Our analysis concentrates on three of the main formalisms for circumscription: the tableau system NTAB introduced by ...
16
Lambek Theorem Proving and Feature Unification
... Within Cat- egorial Unification Grammar Uszkoreit, 1986; Bouma, 1988a, reduction rules are the main op- eration over grammatical objects, but semantic operations are reformulated within [r] ...
7
Algorithms for Generation in Lambek Theorem Proving
... This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover.. The latter possibility enables processi[r] ...
7
Automated theorem-proving in non-classical logics
... For example, the stn·ct implication of the modal systems of [Lewis 18] were motivated by Lewis as presenting a better account of implication, in that strict implication avoided several o[r] ...
196
Proving the Correctness of Pipelined Micro-Architectures
... 2. The second step is to make a sequential implementation of this reference design with the fol- lowing premises: the machine has the same stage structure as the pipelined design. However, the stages are never clocked ...
10
Proving Nontermination via safety
... The tool Invel [30] analyzes nontermination of Java programs using a com- bination of theorem proving and invariant generation. However, Invel does not provide a witness for nontermination. Like ...
16
A Hybrid Approach for Proving Noninterference of Java Programs
... The problem of checking noninterference properties of programs has a long tradition in the field of computer security and, in particular, in language-based security [1]. A program is called noninterferent (w.r.t. ...
24
Competitive Proving for Fun
... with theorem proving was enjoyed, the expert users cracked our simple problems within a number of minutes, and managed to cheat the system in the most creative ...
6