#### DMCA

## A User-friendly Web-based Interface for Automatically Theorem Provers and for Automated Generated Proofs (2010)

### Citations

673 |
An extensible SAT-solver
- Een, Sörensson
(Show Context)
Citation Context ... complete for first-order logic. One of the distinctive features of iProver is a modular combination of firstorder reasoning with ground reasoning. In particular, iProver currently integrates MiniSat =-=[15]-=- for reasoning with ground abstractions of first-order clauses. In addition to instantiation, iProver implements ordered resolution calculus and a combination of instantiation and ordered resolution, ... |

454 | Scaling Step-Wise Refinement”,
- Batory, Sarvela, et al.
- 2004
(Show Context)
Citation Context ...nt in functionality; features are used to distinguish between different variants of a program or software system [33]. Research along different lines has been undertaken to realize the vision of FOSD =-=[33,48,7,12,31,2]-=-. While there are the common notions of a feature and feature composition, present approaches use different techniques, representations, and formalisms. Feature algebra [3,26] is such a framework for ... |

140 | D.Plaisted, Completion without failure,
- Bachmair
- 1987
(Show Context)
Citation Context ...of equality by rewriting rules and Knuth-Bendix completion. – Waldmeister C09a (via TPTP) [21] is a system for unit equational deduction. Its theoretical basis is unfailing completion in the sense of =-=[5]-=- with refinements towards ordered completion (cf. [4]). The system saturates the input axiomatization, distinguishing active facts, which induce a rewrite relation, and passive facts, which are the on... |

132 | Analyzing Security Protocols with Secrecy Types and Logic Programs.
- Abadi, Blanchet
- 2005
(Show Context)
Citation Context ...nificant and important success systems has been achieved with ATP, are software and hardware verification (e.g. [37,13]), software development (e.g. [3]), analysis of network security protocols (e.g. =-=[1,41]-=-) and mathematics (e.g. [52,38]). Full automation (without user interaction) is often only possible by first-order logic. For these tasks ATP systems like Vampire [49] and Prover9 [40] exist. The broa... |

89 | Aspectual Feature Modules’,
- Apel, Saake, et al.
- 2008
(Show Context)
Citation Context ...nt in functionality; features are used to distinguish between different variants of a program or software system [33]. Research along different lines has been undertaken to realize the vision of FOSD =-=[33,48,7,12,31,2]-=-. While there are the common notions of a feature and feature composition, present approaches use different techniques, representations, and formalisms. Feature algebra [3,26] is such a framework for ... |

41 | New directions in instantiation-based theorem proving.
- Ganzinger, Korovin
- 2003
(Show Context)
Citation Context ...ess is parameterized by a reduction ordering and a heuristic assessment of passive facts [22]. – iProver 0.7 (via TPTP) [34] is an automated theorem prover based on an instantiation calculus Inst-Gen =-=[17,35]-=- which is complete for first-order logic. One of the distinctive features of iProver is a modular combination of firstorder reasoning with ground reasoning. In particular, iProver currently integrates... |

37 |
Refining atomicity in parallel algorithms.
- Back
- 1988
(Show Context)
Citation Context ... syntax, which is mainly prefix, is difficult to read, to write and to understand. An “unreadable” example is given inFigure 1, where Back’s atomicity refinement law is encoding using Kleene algebra =-=[6,57,29]-=-. fof(goals,conjecture,( ! [X0,X1,X2,X3,X4,X5] : ( ( leq(X0,multiplication(X0,X1)) & leq(X2,multiplication(X1,X2)) & multiplication(X1,X3) = zero & leq(multiplication(addition(addition(X2,X3),X4),X5),... |

26 | An algebraic foundation for automatic feature-based program synthesis.
- Apel, Lengauer, et al.
- 2010
(Show Context)
Citation Context ... into a wide variety of domains. Examples where significant and important success systems has been achieved with ATP, are software and hardware verification (e.g. [37,13]), software development (e.g. =-=[3]-=-), analysis of network security protocols (e.g. [1,41]) and mathematics (e.g. [52,38]). Full automation (without user interaction) is often only possible by first-order logic. For these tasks ATP syst... |

23 |
Using Kleene Algebra to Reason About Concurrency Control
- Cohen
- 1994
(Show Context)
Citation Context ...al case studies [27,28]. – These structures and variants of them have been emerged as fundamental structures in computing. They have been used in various applications ranging from concurrency control =-=[11,23,24]-=- over program analysis and semantics, like Hoare logic [36,42] and the wp-calculus of Dijkstra [43] to hybrid systems. [25] For the purpose of the paper we present two examples: The first present an a... |

20 | A logic for rough sets.
- Düntsch
- 1997
(Show Context)
Citation Context ...in IL we assume that φ is true if ⊢ φ and ¬φ otherwise. This is closely related to negation as failure as it is utilised in Prolog [18]. Our interest in IL is motivated by reasoning with rough logic, =-=[14,45,46]-=-In the course of theory refinement in machine learning one seeks to find a set H of formulas (“hypothesis”) which together with a given theory Φ (“background knowledge”) entails a set of positive exam... |

17 |
Formal specifications and industrial-strength code — from myth to reality
- Das
- 2006
(Show Context)
Citation Context ...(ATP) has brought automated reasoning into a wide variety of domains. Examples where significant and important success systems has been achieved with ATP, are software and hardware verification (e.g. =-=[37,13]-=-), software development (e.g. [3]), analysis of network security protocols (e.g. [1,41]) and mathematics (e.g. [52,38]). Full automation (without user interaction) is often only possible by first-orde... |

12 | On Using Ground Joinable Equations in Equational Theorem Proving
- Avenhaus, Hillenbrand, et al.
- 2003
(Show Context)
Citation Context ...etion. – Waldmeister C09a (via TPTP) [21] is a system for unit equational deduction. Its theoretical basis is unfailing completion in the sense of [5] with refinements towards ordered completion (cf. =-=[4]-=-). The system saturates the input axiomatization, distinguishing active facts, which induce a rewrite relation, and passive facts, which are the one-step conclusions of the active ones up to redundanc... |

10 | Citius altius fortius: Lessons learned from the theorem prover Waldmeister (invited paper).
- Hillenbrand
- 2003
(Show Context)
Citation Context ...order equational logic. It implements an ordered resolution and paramodulation calculus and, by its treatment of equality by rewriting rules and Knuth-Bendix completion. – Waldmeister C09a (via TPTP) =-=[21]-=- is a system for unit equational deduction. Its theoretical basis is unfailing completion in the sense of [5] with refinements towards ordered completion (cf. [4]). The system saturates the input axio... |

7 | Modeling workflows, interaction patterns, web services and business processes: The asm-based approach
- Börger, Thalheim
- 2008
(Show Context)
Citation Context ...rtal provides a very simple testbed by which one could give it a try and endeavour a verification by parallel execution of many provers—hoping that atleast one will return an answer soon enough (c.f. =-=[8]-=-).Acknowledgements: We are grateful to Han-Hing Dang and Sarah Edenhofer, Roland Glück and Markus Teufelhart for implementing parts of ATPPortal and to Bernhard Möller for many fruitful remarks. We w... |

4 |
Applied Theorem Proving - Natural Language Testsuite. http://www.coli.unisb.de/ bos/atp
- Bos
- 2000
(Show Context)
Citation Context ... a common language and a common interface for first-order ATP systems. The TPTP library have extensively been used by different users in various case studies covering various areas of sciences (e.g., =-=[9,27,29,30,60]-=-). Though TPTP with all its components is easy to use for experts, we see two disadvantages: – For an average user, the TPTP syntax, which is mainly prefix, is difficult to read, to write and to under... |

4 |
Beginning Java EE 6 Platform with GlassFish 3: From Novice to Professional. Apress
- Goncalves
- 2009
(Show Context)
Citation Context ...Software ATPPortal Implementation. For the implementation of ATPPortal v.1.0, we have built on several different technologies we list in the following: – Java Platform, Enterprise Edition (JEE) (e.g. =-=[19]-=-) is a Java platform for server programming that differs from the Java Standard Edition Platform (Java SE) in that it provides libraries for the development for fault-tolerant, distributed, multi-tier... |

1 |
Tomcat: The definitive guide, 2nd edition
- Brittain, Darwin
(Show Context)
Citation Context ... containing dynamic Web content such as HTML, DHTML, XHTML and XML. The JavaServer Pages technology allows to create dynamic content. In ATPPortal we use JSP 2.1. – Apache Tomcat version 6.0.24 (e.g. =-=[10]-=-) is an open source implementation of the Java Servlet and the JavaServer Pages specifications. – Since the ATPPortal collects, manages and catalogues data (theorems, axioms and proofs), a database is... |

1 |
Negation as inconsistency in prolog via intuitionistic logic
- Gomolko
- 1993
(Show Context)
Citation Context ... in the sense that while in full logic it either holds that φ or ¬φ, in IL we assume that φ is true if ⊢ φ and ¬φ otherwise. This is closely related to negation as failure as it is utilised in Prolog =-=[18]-=-. Our interest in IL is motivated by reasoning with rough logic, [14,45,46]In the course of theory refinement in machine learning one seeks to find a set H of formulas (“hypothesis”) which together wi... |

1 |
Using the Jakarta
- Goyal
- 2003
(Show Context)
Citation Context ...ld the open source JAVA-based project, we use Apache Ant 4 . It is a software tool for automating software build processes similar to Make but is implemented using the Java language. – Apache Commons =-=[20]-=- provides reusable, open source Java software. The Commons is composed of three parts: proper, sandbox, and dormant. Theorem Provers. As mentioned in the introduction, one of the main purposes of ATPP... |