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.
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logictheories that...
详细信息
ISBN:
(纸本)3540285385
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logictheories that express, at the same time, the two basic challenges in database composition problems: relating different schemas of the local databases to one global schema (schema integration) and amalgamating the distributed and possibly contradictory data to one consistent database (data integration). We show that our framework supports different methods for schema integration (as well as their combinations) and that it provides a straightforward way of dealing with inconsistent data. Moreover, this framework facilitates the implementation of database repair and consistent query answering by means of a variety of reasoning systems.
A novel inductive logicprogramming 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 logicprogramming 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 logicprogramming 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.
Computer programming languages have a textual syntax and, in many cases, an imperative logic, based on von Newman architecture, which often makes its use by non specialized people difficult. this study explores an opt...
详细信息
ISBN:
(纸本)1920017119
Computer programming languages have a textual syntax and, in many cases, an imperative logic, based on von Newman architecture, which often makes its use by non specialized people difficult. this study explores an option to minimize the problems faced in the programming learning process seeking a definition of compositional visual programming language based on the notion of 'behavior'. A language based on behaviors is declarative, which differentiates it from the majority of visual languages found in the literature, which are imperative. the notion of behavior defines a set of actions and reactions which an actor has during its existence. In the implemented environment, actors are graphic objects capable of moving themselves. the interface chosen for the visual language, is based on the concept of jigsaw-type pieces, a set behaviors being available to the users which may be attributed to objects through the fitting of pieces belonging to the interface.
In answer set programming systems like Smodels and some SAT solvers, constraint propagation is carried out by a mechanism called lookahead. the question arises as what is the pruning power of lookahead, and how such p...
详细信息
ISBN:
(纸本)3540285385
In answer set programming systems like Smodels and some SAT solvers, constraint propagation is carried out by a mechanism called lookahead. the question arises as what is the pruning power of lookahead, and how such pruning power fares in comparison withthe consistency techniques in solving CSPs. In this paper, we study the pruning power of lookahead by relating it to local consistencies under two different encodings from CSPs to answer set programs. this leads to an understanding of how the search space is pruned in an answer set solver with lookahead for solving CSPs. On the other hand, lookahead as a general constraint propagation mechanism provides a uniform algorithm for enforcing a variety of local consistencies. We also study the impact on the search efficiency under these encodings.
Possibilistic Defeasible logicprogramming (P DeLP) is a logic pro gramming language which combines features from argumentation theory and logicprogramming incorporating as well the treatment of possibilistic uncerta...
详细信息
ISBN:
(纸本)9781586035600
Possibilistic Defeasible logicprogramming (P DeLP) is a logic pro gramming language which combines features from argumentation theory and logicprogramming incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object language level Defeasible argumentation in general and P DeLP in particular provide a way of modelling non monotonic inference From a logical viewpoint capturing defeasible inference relationships for modelling argument and warrant is particularly important as well as the study of their logical properties this paper analyzes a non monotonic operator for P DeLP which models the expansion of a given program P by adding new weighed facts associated with warranted literals Different logical properties are studied and contrasted with a traditional SLD based Horn logic providing useful comparison criteria that can be extended and applied to other argumentation frameworks
Aggregates in answer set programming (ASP) have recently been studied quite intensively. the main focus of previous work has been on defining suitable semantics for programs with arbitrary, potentially recursive aggre...
详细信息
ISBN:
(纸本)3540285385
Aggregates in answer set programming (ASP) have recently been studied quite intensively. the main focus of previous work has been on defining suitable semantics for programs with arbitrary, potentially recursive aggregates. By now, these efforts appear to have converged. On another line of research, the relation between unfounded sets and (aggregate-free) answer sets has lately been rediscovered. It turned out that most of the currently available answer set solvers rely on this or closely related results (e.g., loop formulas). In this paper, we unite these lines and give a new definition of unfounded sets for disjunctive logic programs with arbitrary, possibly recursive aggregates. While being syntactically somewhat different, we can show that this definition properly generalizes all main notions of unfounded sets that have previously been defined for fragments of the language. We demonstrate that, as for restricted languages, answer sets can be crisply characterized by unfounded sets: they are precisely the unfounded-free models. this result can be seen as a confirmation of the robustness of the definition of answer sets for arbitrary aggregates. We also provide a comprehensive complexity analysis for unfounded sets, and study its impact on answer set computation.
the formalism of nonmonotonic causal theories (Ciunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonic reasoning and knowledge representation, as well as a higher level...
详细信息
ISBN:
(纸本)3540285385
the formalism of nonmonotonic causal theories (Ciunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonic reasoning and knowledge representation, as well as a higher level, special-purpose notation, the action language C+, for specifying and reasoning about the effects of actions and the persistence ('inertia') of facts over time. In this paper we investigate some logical properties of these formalisms. there are two motivations. From the technical point of view, we seek to gain additional insights into the properties of the languages when viewed as a species of conditional logic. From the practical point of view, we are seeking to find conditions under which two different causal theories, or two different action descriptions in C+, can be said to be equivalent, withthe further aim of helping to decide between alternative formulations when constructing practical applications.
We proposed an advanced minimization method for multiple valued multiple output functions in this paper. We extracted the shared sub functions with a proposed heuristic method to pair the functions. New minimization a...
详细信息
Genetic Parallel programming (GPP) is a novel Genetic programming paradigm. GPP logic Circuit Synthesizer (GPPLCS) is a combinational logic circuit learning system based on GPP. the GPPLCS comprises a Multi-logic-Unit...
详细信息
暂无评论