The proceedings contain 22 papers. The topics discussed include: a preliminary report on integrating of answer set and constraint solving;extending conceptual logic programs with arbitrary rules;combining answer sets ...
The proceedings contain 22 papers. The topics discussed include: a preliminary report on integrating of answer set and constraint solving;extending conceptual logic programs with arbitrary rules;combining answer sets of nonmonotonic logic programs;an algebraic account of modularity in ID-logic;Nelson's strong negation, safe beliefs and the answer set semantics;disjunctive answer set programming via satisfiability;reducing propositional theories in equilibrium logic to logic programs;towards implementations for advanced equivalence checking in answer-set programming;SELP - a system for studying strong equivalence between logic programs;debugging logic programs under the answer set semantics;an experimental study of search strategies and heuristics in answer set programming;an interactive approach to answer set programming;a backjumping technique for disjunctive logicprogramming;and a language for modular answer set programming: application to ACC tournament scheduling.
The effects of database updates, context switches, and the introduction of reusable components to declarative programming are given concise explanations in terms of many-sorted logical metaprograms, in a way that supp...
详细信息
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing str...
详细信息
ISBN:
(纸本)158113388X
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing strategies, to execute functional logic programs. We translate functional logic programs into imperative (Java) programs without an intermediate abstract machine. A central idea of our approach is the explicit representation and processing of narrowing computations as data objects. This enables the implementation of operationally complete strategies (i.e., without back-tracking) or techniques for search control (e.g., encapsulated search). Thanks to the use of an intermediate and portable representation of programs, our implementation is general enough to be treed as a common back end for a wide variety of functional logic languages.
The proceedings contain 13 papers. The topics discussed include: intelligent textbooks;mathematical formula representation via tree embeddings;dental TutorBot: exploitation of dental textbooks for automated learning;t...
The proceedings contain 13 papers. The topics discussed include: intelligent textbooks;mathematical formula representation via tree embeddings;dental TutorBot: exploitation of dental textbooks for automated learning;transforming textbooks into learning by doing environments: an evaluation of textbook-based automatic question generation;the mobile fact and concept textbook system (MoFaCTS) computational model and scheduling system;using semantics of textbook highlights to predict student comprehension and knowledge retention;contextual definition generation;generation of assessment questions from textbooks enriched with knowledge models;integrating textbooks with smart interactive content for learning programming;and PUMPT: an e-textbook platform based on a personal user model for learning.
An introspective agent can represent the connection between her own beliefs and the state of the world, using introspection principles to reason about this connection. An ideal introspective agent is one who makes the...
详细信息
In many applications, faults are triggered by events that occur in a particular order. Based on the assumption that most bugs are caused by the interaction of a low number of events, Kuhn et al. recently introduced se...
详细信息
ISBN:
(纸本)9781612081687
In many applications, faults are triggered by events that occur in a particular order. Based on the assumption that most bugs are caused by the interaction of a low number of events, Kuhn et al. recently introduced sequence covering arrays (SCAs) as suitable designs for event sequence testing. In practice, directly applying SCAs for testing is often impaired by additional constraints, and SCAs have to be adapted to fit application-specific needs. Modifying precomputed SCAs to account for problem variations can be problematic, if not impossible, and developing dedicated algorithms is costly. In this paper, we propose answer-set programming (ASP), a well-known knowledge-representation formalism from the area of artificial intelligence based on logicprogramming, as a declarative paradigm for computing SCAs. Our approach allows to concisely state complex coverage criteria in an elaboration tolerant way, i.e., small variations of a problem specification require only small modifications of the ASP representation.
The proceedings contain 48 papers. The topics discussed include: on the effect of complex network topology in managing epidemic outbreaks;holt’s linear model of COVID-19 morbidity forecasting in Ukraine;knowledge rep...
The proceedings contain 48 papers. The topics discussed include: on the effect of complex network topology in managing epidemic outbreaks;holt’s linear model of COVID-19 morbidity forecasting in Ukraine;knowledgerepresentation and automated formal reasoning in description logic ALC;solutions outlining on the set of structured technological problems with imposed constraints;mathematical models of group dynamics when working in teams of developers of training distance courses;activating the process of educational services using independent computing resources to manage and monitor the quality of learning;and the developing of the system for automatic audio to text conversion.
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and...
详细信息
A uniqueness type system is used to distinguish values which are referenced at most once from values which may be referenced an arbitrary number of times in a program. Uniqueness type systems are used in the Clean and Mercury programming languages to provide efficiently updatable data-structures and I/O without compromising referential transparency. In this paper we establish a Curry-Howard-Lambek equivalence between a form of uniqueness types and a 'resource-sensitive' logic. This logic is similar to intuitionistic linear logic, however the circle modality, which moderates the structural rules in the antecedent in the same way as !, is introduced via the dual ? rules. We discuss the categorical proof theory and models of this new logic, as well as its computational interpretation. (c) 2005 Elsevier B.V. All rights reserved.
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. Fuzzy Description logics were born to represent the former type of knowledge, but they require an appropriate fuzzy lan...
详细信息
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. Fuzzy Description logics were born to represent the former type of knowledge, but they require an appropriate fuzzy language to be agreed and an important number of available resources to be adapted. This paper faces these problems by presenting a reasoning preserving procedure to obtain a crisp representation for a fuzzy extension of the logic SROIQ which uses Gödel implication in the semantics of fuzzy concept and role subsumption. This reduction allows to reuse a crisp representation language as well as currently available reasoners. Our procedure is optimized with respect to the related work, reducing the size of the resulting knowledge base, and is implemented in DeLorean, the first reasoner supporting fuzzy OWL DL.
After several years of neglect, the importance of partial deduction (previously, partial evaluation in logicprogramming) as an omnipresent principle in logicprogramming, and to a certain degree in computing in gener...
详细信息
暂无评论