Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,746
Accounting Knowledge Representation in PROLOG Language
"... This paper presents some original techniques for implementing accounting knowledge in PROLOG language. We will represent rules of operation of accounts, the texts of accounting operations, and how to compute the depreciation. ..."
Abstract
- Add to MetaCart
This paper presents some original techniques for implementing accounting knowledge in PROLOG language. We will represent rules of operation of accounts, the texts of accounting operations, and how to compute the depreciation.
Part I: The Prolog Language Types and Terms
"... [Felty, JAR'93] Amy Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43{81, ..."
Abstract
- Add to MetaCart
[Felty, JAR'93] Amy Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43{81,
GOLOG: A Logic Programming Language for Dynamic Domains
, 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract
-
Cited by 628 (74 self)
- Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world
Uniform proofs as a foundation for logic programming
- ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract
-
Cited by 428 (122 self)
- Add to MetaCart
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide
The NRL Protocol Analyzer: An Overview
, 1996
"... this paper we give an overview of how the Analyzer works and describe its achievements so far. We also show how our use of the Prolog language benefited us in the design and implementation of the Analyzer. / 1. INTRODUCTION ..."
Abstract
-
Cited by 274 (20 self)
- Add to MetaCart
this paper we give an overview of how the Analyzer works and describe its achievements so far. We also show how our use of the Prolog language benefited us in the design and implementation of the Analyzer. / 1. INTRODUCTION
Prolog
, 2004
"... The idea behind logic programming is to describe a domain and ask questions about that domain. The domain description and the question is formed using logical statements found in mathematical logic. To make logic programming usefull, the mathematical logic is extended by adding control found in prog ..."
in Prolog
, 2000
"... This thesis investigates whether region-based memory management can successfully be applied to Prolog programs. The answer is affirmative. It is shown how region-based memory management can be extended to work with backtracking and logical variables. Experiments with a prototype region-based Prolog ..."
Abstract
- Add to MetaCart
This thesis investigates whether region-based memory management can successfully be applied to Prolog programs. The answer is affirmative. It is shown how region-based memory management can be extended to work with backtracking and logical variables. Experiments with a prototype region-based Prolog
Prolog
"... Termination is a crucial property of programs. Therefore, techniques to analyze termi-nation automatically are highly important for program verification. Traditionally, tech-niques for automated termination analysis were mainly studied for declarative program-ming paradigms such as logic programming ..."
Abstract
- Add to MetaCart
programming and term rewriting. However, in the last years, several powerful techniques and tools have been developed which analyze the termination of programs in many programming languages including Java, C, Haskell, and Prolog. In order to re-use the wealth of existing tools and techniques developed
Results 1 - 10
of
1,746
