this paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the i...
详细信息
ISBN:
(纸本)3540667490
this paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action language C. We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. the translations from C into logicprogrammingthat we investigate serve as a basis for the use of systems for computing answer sets to reason about action domains described in C and to generate plans in such domains.
the IEC 61131-3 standard defines a common framework for programming PLCs (Programmable logic Controllers), which includes the complete definition of four programming languages and a state machine definition language. ...
详细信息
ISBN:
(纸本)9781424408504
the IEC 61131-3 standard defines a common framework for programming PLCs (Programmable logic Controllers), which includes the complete definition of four programming languages and a state machine definition language. Industrial PLC vendors are slowly offering support for this standard, however small inconsistencies remain between their implementations, transferring programs between vendors is almost impossible due to different rile formats, and licenses are generally too expensive to allow students do install these commercial solutions on their own computers. To this end, the authors have developed an Integrated Development Environment (IDE) for the IEC 61131-3 framework, which is being offered to the general public under the GNU Public License (GPL). the IDE consists of a Graphical User Interface (GUI) and a backend compiler. Using the GUI the user may develop programs in any of the four programming languages, as well as the state machine definition language. the backend compiler is used to convert these programs into equivalent C++ programs which may later be compiled and executed on various platforms.
Contracts (dynamically checked programmer assertions) are a widely accepted mechanism for specifying, checking and documenting properties of software components. Most, if not all, contract systems expect programmers t...
详细信息
this volume contains the papers presented, and subsequently submitted for publication, at the 5thlogicprogrammingconference, held June 23-26, 1986 in Tokyo. Topics covered include Prolog machine architecture, Prolo...
详细信息
ISBN:
(数字)9783540477129
ISBN:
(纸本)9783540180241
this volume contains the papers presented, and subsequently submitted for publication, at the 5thlogicprogrammingconference, held June 23-26, 1986 in Tokyo. Topics covered include Prolog machine architecture, Prolog processors, variations of Prolog language, and applications of Prolog to natural language understanding, and expert systems. Most of the works reported in the volume are related to the Japanese Fifth Generation Computer Project allowing readers to compare results from this project withthose from similar projects currently being conducted in other countries.
In this paper,it has been explored that the use of logic rules as key element in concept refinement Learning.A logic rule is a formal grammar in logic for expressing formation rules of a formal language. First order l...
详细信息
In this paper a set of student's characteristics that have to be considered in an adaptive and/or personalized programming tutoring system is presented. this set is called *** and includes: knowledge, errors, moti...
详细信息
ISBN:
(纸本)9781479961719
In this paper a set of student's characteristics that have to be considered in an adaptive and/or personalized programming tutoring system is presented. this set is called *** and includes: knowledge, errors, motivation and cognitive states. It allows the system to identify the variety of backgrounds of prospective learners of programming, their misconceptions, needs and learning pace. the modeling of K.E.M.C.s is performed through a combination of different student modeling techniques: overlay, stereotypes, fuzzy logic and OCC cognitive theory. the gain of this approach is that the particular student model represents a sufficiently large part of the complex dimensions of a real student of programming. therefore, it can be the base for the improvement of the quality of the learning process.
the addition of preferences to normal logic pro-rams is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A(1) is preferred to that of an atom A(2) a preference rule can be ...
详细信息
the addition of preferences to normal logic pro-rams is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A(1) is preferred to that of an atom A(2) a preference rule can be defined so that A(2) is derived only if A(1) is not. Although such situations can be modelled directly using default negation, it is often easier to define preference rules than it is to add negation to the bodies of rules. As first noted by Govindarajan et al. [Proc. Internat. Conf. on logicprogramming, 1995, pp. 731-746], for certain grammars, it may be easier to disambiguate parses using preferences than by enforcing disambiguation in the grammar rules themselves. In this paper we define a general fixed-point semantics for preference logic programs based on an embedding into the well-founded semantics, and discuss its features and relation to previous preference logic semantics. We then study how preference logic grammars are used in data standardization, the commercially important process of extracting useful information from poorly structured textual data. this process includes correcting misspellings and truncations that occur in data, extraction of relevant C, 41 information via parsing, and correcting inconsistencies in the extracted information. the declarativity of Prolog offers natural advantages for data standardization, and a commercial standardizer has been implemented using Prolog. However, we show that the use of preference logic grammars allow construction of a much more powerful and declarative commercial standardizer, and discuss in detail how the use of the non-monotonic construct of preferences leads to improved commercial software. (C) 2002 Elsevier Science B.V. All rights reserved.
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e....
详细信息
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. the computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small subclass of the language called basic constraint rules is devised. An implementation of the language, the SMODELS System, is developed based on this embedding. It uses a two level architecture consisting of a front-end and a kernel language implementation. the front-end allows restricted use of variables and functions and compiles general weight constraint rules to basic constraint rules. A major part of the work is the development of an efficient search procedure for computing stable models for this kernel language. the procedure is compared with and empirically tested against satisfiability checkers and an implementation of the stable model semantics. It offers a competitive implementation of the stable model semantics for normal programs and attractive performance for problems where the new types of rules provide a compact representation. (C) 2002 Elsevier Science B.V. All rights reserved.
this paper introduces techniques for updating knowledge bases represented in extended logic programs. three different types of updates, view updates, theory updates, and inconsistency removal, are considered. We formu...
详细信息
ISBN:
(纸本)3540667490
this paper introduces techniques for updating knowledge bases represented in extended logic programs. three different types of updates, view updates, theory updates, and inconsistency removal, are considered. We formulate these updates through abduction, and provide methods for computing them with update programs. An update program is an extended logic program which specifies changes on abductive hypotheses, then updates are computed by the U-minimal answer sets of an update program. the proposed technique provides a uniform framework for these different types of updates, and each update is computed using existing procedures of logicprogramming.
In this paper, the co-ordinated system of fuzzy logic and evolutionary programming (FCEP), is presented. the main idea behind the FCEP is that a fuzzy mutation controller is implemented to adaptively update the mutati...
详细信息
ISBN:
(纸本)0780336461
In this paper, the co-ordinated system of fuzzy logic and evolutionary programming (FCEP), is presented. the main idea behind the FCEP is that a fuzzy mutation controller is implemented to adaptively update the mutation rate during the evolutionary process. the major advantage of the FCEP lies in its potential to quickly find the global optimal solution or the near optimal solutions under a series of constraints.
暂无评论