Frieder Stolzenburg, Bernd Thomas  Home/Search
Context
Related
| unikoblenz.de/home/bt...banking.pdf.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berndthomas.de/work1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: INTRODUCTION We show that theorem proving, logic programming and constraint solving can be combined in a straightforward manner. This is shown not only by setting up a theoretical framework, but also by a real world application: the calculation of banking fees. We tackle the problem of deciding whether such a rule set is total and deterministic. Although these questions are undecidable in general, the restricted form of the investigated rule sets makes them decidable and even tractable in... (Update)
Similar documents based on text: More All
0.3: From the Specification of Multiagent Systems by Statecharts.. - Stolzenburg, Arai (Correct)
0.3: Nonmonotonic Reasoning: Towards Efficient Calculi and.. - Dix, Furbach, Niemelä (1998) (Correct)
0.2: Analysing Rule Sets for the Calculation of Banking Fees by.. - Frieder Stolzenburg (1998) (Correct)
BibTeX entry: (Update)
@incollection{ stolzenburg98analyzing,
author = "F. Stolzenburg and B. Thomas",
title = "Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints",
booktitle = "Automated Deduction: A Basis for Applications. Volume {III}, Applications",
publisher = "Kluwer Academic Publishers",
address = "Dordrecht",
editor = "Wolfgang Bibel and Peter H. Schmidt",
year = "1998",
url = "citeseer.ist.psu.edu/stolzenburg98analyzing.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
373 Constraint Logic Programming: a Survey - Jaffar, Maher - 1994
185 A Sufficient Condition for Backtrack-Free Search (context) - Freuder - 1982
142 Automated Theorem Proving (context) - Bibel - 1982
103 Automated Deduction by Theory Resolution - Stickel - 1985
97 A Prolog Technology Theorem Prover: Implementation by an Ext.. - Stickel - 1988
74 Mechanical Theorem Proving by Model Elimination (context) - Loveland - 1968
57 A Logic Programming View of CLP - Maher - 1993
48 PROTEIN: A PROver with a Theory Extension INterface - Baumgartner, Furbach - 1994
24 Integrating Logical Functions with ILF - Dahn, Gehne et al. - 1995
16 Computing answers with model elimination - Baumgartner, Furbach et al. - 1997
15 Analysing Rule Sets for the Calculation of Banking Fees by a.. - Stolzenburg, Thomas - 1996
11 Constraint Model Elimination and a PTTP-Implementation (context) - Baumgartner, Stolzenburg - 1995
7 Tablewise, a Decision Table Tool (context) - Hoover, Chen - 1995
4 Strategies for Building Propositional Expert Systems (context) - Colomb, Chung - 1995
[Article contains additional citations not shown here]
Documents on the same site (http://www.berndthomas.de/work1.html): More
Learning T-Wrappers for Information Extraction - Thomas (1999) (Correct)
Learning T-Wrappers for Information Extraction - Thomas (2001) (Correct)
Automated Deduction: A Technological Point of View - Peter Baumgartner, Ingo.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC