We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects ...
详细信息
ISBN:
(纸本)3540285385
We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects (ramifications). We give formal results which characterize ME's high degree of modularity and elaboration tolerance, and show how these properties help to separate out, and provide a principled solutions to, the endogenous and exogenous qualification problems. We also show how a notion of (micro) processes can be used to facilitate reasoning at the dual levels of temporal granularity necessary for narrative-based domains involving "instantaneous" series of indirect and knock-on effects.
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. During tabled execution, several decisions have to be made. These are determined by...
详细信息
ISBN:
(纸本)354029208X
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. During tabled execution, several decisions have to be made. These are determined by the scheduling strategy. Whereas a strategy can achieve very good performance for certain applications, for others it might add overheads and even lead to unacceptable inefficiency. The ability of using multiple strategies within the same evaluation can be a means of achieving the best possible performance. In this work, we present how the YapTab system was designed to support dynamic mixed-strategy evaluation of the two most successful tabling scheduling strategies: batched scheduling and local scheduling.
An untyped algorithm to test beta eta-equality for Martin-Lof's logical Framework with strong Sigma-types is presented and proven complete using a model of partial equivalence relations between untyped terms.
ISBN:
(数字)9783540320142
ISBN:
(纸本)3540255931
An untyped algorithm to test beta eta-equality for Martin-Lof's logical Framework with strong Sigma-types is presented and proven complete using a model of partial equivalence relations between untyped terms.
Automata-based approach, proposed for the programming of the virtual autonomous reactive agents control systems used in the famous "Robocode" game is extended in this paper to the creation of the control sys...
详细信息
ISBN:
(纸本)078039013X
Automata-based approach, proposed for the programming of the virtual autonomous reactive agents control systems used in the famous "Robocode" game is extended in this paper to the creation of the control systems of the reactive multi-agent real-life environment agents. We demonstrate the efficiency of the proposed approach by the example of creation of transportation system, which consists of two interacting robots and is assembled from the famous "Lego Mindstorms" kit. The advantage of this approach is the formalization of the implementation process and the simplification of testing and modification.
Stochastic logic programs (SLPs) provide an efficient representation for complex tasks such as modelling metabolic pathways. In recent years, methods have been developed to perform parameter and structure learning in ...
详细信息
ISBN:
(纸本)3540298967
Stochastic logic programs (SLPs) provide an efficient representation for complex tasks such as modelling metabolic pathways. In recent years, methods have been developed to perform parameter and structure learning in SLPs. These techniques have been applied for estimating rates of enzyme-catalyzed reactions with success. However there does not exist any method that can provide statistical inferences and compute confidence in the learned SLP models. We propose a novel approach for drawing such inferences and calculating confidence in the parameters on SLPs. Our methodology is based on the use of a popular technique, the bootstrap. We examine the applicability of the bootstrap for computing the confidence intervals for the estimated SLP parameters. In order to evaluate our methodology we concentrated on computation of confidence in the estimation of enzymatic reaction rates in amino acid pathway of Saccharomyces cerevisiae. Our results show that our bootstrap based methodology is useful in assessing the characteristics of the model and enables one to draw important statistical and biological inferences.
A novel inductive logic programming system, called Classic'cl is presented. Classic'cl integrates several settings for learning, in particular learning from interpretations and learning from satisfiability. Wi...
详细信息
ISBN:
(数字)9783540316985
ISBN:
(纸本)3540292306
A novel inductive logic programming system, called Classic'cl is presented. Classic'cl integrates several settings for learning, in particular learning from interpretations and learning from satisfiability. Within these settings, it addresses descriptive and probabilistic modeling tasks. As such, Classic'cl (C-armr, cLAudien, icl-S(S)at, ICI, and CLI-pad) integrates several well-known inductive logic programming systems such as Claudien, Warmr (and its extension C-armr), ICL, ICL-SAT, and LLPAD. We report on the implementation, the integration issues as well as on some experiments that compare Classic'cl with some of its predecessors.
We consider the problem of identifying equivalence of two knowledge bases which are capable of abductive reasoning. Here, a knowledge base is written in either first-order logic or nonmonotonic logic programming. In t...
详细信息
We consider the problem of identifying equivalence of two knowledge bases which are capable of abductive reasoning. Here, a knowledge base is written in either first-order logic or nonmonotonic logic programming. In this work, we will give two definitions of abductive equivalence. The first one, explainable equivalence, requires that two abductive programs have the same explainability for any observation. Another one, explanatory equivalence, guarantees that any observation has exactly the same explanations in each abductive framework. Explanatory equivalence is a stronger notion than explainable equivalence. In first-order abduction, explainable equivalence can be verified by the notion of extensional equivalence in default theories. In nonmonotonic logic programs, explanatory equivalence can be checked by means of the notion of relative strong equivalence. We also show the complexity results for abductive equivalence.
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown t...
详细信息
ISBN:
(纸本)3540291067
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order zeta-calculus is modelled by this notion, which on turn is included in a Morris style contextual equivalence.
Supporting active rules has become an important characteristic of modem database systems. While active rules termination is an undecidable problem, several recent works have suggested proving termination by using trig...
详细信息
ISBN:
(纸本)3540292276
Supporting active rules has become an important characteristic of modem database systems. While active rules termination is an undecidable problem, several recent works have suggested proving termination by using triggering and activation graphs. In this paper, we propose such concepts as activation reachable, activation path, inhibited activation cycle, inhibited activation rule, effective activation path to refine these works. Based on these concepts and the formula constructed for an effective activation path, we show how to determine the termination of active rules set. The analytical results prove that our approach can detect more termination situations than existing works. Moveover, the proposed approach is practical and general with respect to the various rule languages from Event-Condition-Action language for XML to the trigger language in SQL: 1999 standard. As a result, it can be easily applied to modem database systems.
In this paper we generalize the notion of approximation of action theories introduced in [ 13,26]. We introduce a logic programming based method for constructing approximation of action theories of AL and prove its so...
详细信息
ISBN:
(纸本)3540285385
In this paper we generalize the notion of approximation of action theories introduced in [ 13,26]. We introduce a logic programming based method for constructing approximation of action theories of AL and prove its soundness. We describe an approximation based conformant planner and compare its performance with other state-of-the-art conformant planners.
暂无评论