MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Serge Autexier" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 31 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • A Framework for Generic and Reusable Tactics  
  • by Serge Autexier, Serge Autexier — 1999
  • …In this paper we present a framework for the definition of generic and thus reusable tactics. We present an extension of the window inference technique which is the formal basis of a hierarchical, problem-reduction style of reasoning. The window inference technique is analyzed and general reasoni…
  • Add To MetaCart
  • A Proof-Planning Framework with explicit Abstractions based on Indexed Formulas  
  • by Serge Autexier — 2001 — Electronic Notes in Theoretical Computer Science
  • …A major motivation of proof-planning is to bridge the gap between high-level, cognitively adequate reasoning for specific domains, and calculus-level reasoning to ensure soundness. For high reasoning levels the cognitive adequacy of representation and reasoning techniques is a major issue, while…
  • Cited by 7 (5 self) – Add To MetaCart
  • Towards an Efficient Management of Change in an Evolutionary Formal Software Development  
  • by Serge Autexier, Dieter Hutter — 2000
  • …e the corresponding specication has been changed. Each node of a development graph corresponds to a specication module and denes a logical theory, i.e. a signature, a consequence relation, and a set of local axioms. The directed links in the graph relate theories to each other via consequence morph…
  • Add To MetaCart
  • Disproving False Conjectures  
  • by Serge Autexier, Carsten Schürmann — 2003 — Proceedings of the 10 th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, volume 2850 of LNAI
  • …For automatic theorem provers it is as important to disprove false conjectures as it is to prove true ones, especially if it is not known ahead of time if a formula is derivable inside a particular inference system.…
  • Cited by 2 (2 self) – Add To MetaCart
  • An Abstraction for Proof Planning: The S-Abstraction  
  • by Serge Autexier, Serge Autexier, Fachbereich Informatik — 1997
  • …ion for Proof Planning: The S-Abstraction Serge Autexier SEKI Report SR-97-05 An Abstraction for Proof Planning: The S-Abstraction Serge Autexier Fachbereich 14, Informatik, Postfach 15 11 50, 66041 Saarbrucken, Germany E-mail: autexier@cs.uni-sb.de Abstract This paper presents a new kind of abs…
  • Cited by 1 (1 self) – Add To MetaCart
  • Equational Proof-Planning by Dynamic Abstraction  
  • by Serge Autexier, Dieter Hutter — 1997 — In M.P. Bonacina and U. Furbach, editors, Proceedings of FTP97
  • …ion Serge Autexier CS Department University of Saarland Dieter Hutter y German Research Centre for Artificial Intelligence Abstract We present a new abstraction designed for the purpose of equational proofplanning. The abstraction maps a given equation into some partial representation of its s…
  • Cited by 5 (3 self) – Add To MetaCart
  • Formal software development in maya  
  • by Serge Autexier, Dieter Hutter — 2005 — Festschrift in Honor of J. Siekmann, volume 2605 of LNAI
  • …1 Introduction Formal methods are used in the software development process to increase the security and safety of software. The software systems as well as their requirement specifications are formalized in a textual manner in some specification language like Casl [4] or Vse-Sl [7]. The specificatio…
  • Cited by 2 (1 self) – Add To MetaCart
  • Textbook proofs meet formal logic - the problem of underspecification and granularity  
  • by Serge Autexier, Armin Fiedler — 2006 — Proceedings of MKM’05, volume 3863 of LNAI, IUB
  • …Abstract. Unlike computer algebra systems, automated theorem provers have not yet achieved considerable recognition and relevance in mathematical practice. A significant shortcoming of mathematical proof assistance systems is that they require the fully formal representation of mathematical content,…
  • Cited by 2 (2 self) – Add To MetaCart
  • Integrating Hol-Casl into the Development Graph Manager  
  • by Serge Autexier, Till Mossakowski — In A. Armando (Ed.) Frontiers of Combining Systems (FroCoS '02), Santa Margherita Ligure, Italy, Springer LNAI
  • …For the recently developed specification language Casl, there exist two different kinds of proof support: while HOL-Casl has its strength in proofs about specifications in-the-small, Maya has been designed for management of proofs in (Casl) specifications in-the-large, within an evolutionary formal …
  • Cited by 15 (10 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB