One recent development in logic programming has been the application of abstract interpretation to verify the partial correctness of a logic program with respect to a given set of assertions. One approach to verificat...
详细信息
ISBN:
(纸本)3540206426
One recent development in logic programming has been the application of abstract interpretation to verify the partial correctness of a logic program with respect to a given set of assertions. One approach to verification is to apply forward analysis that starts with an initial goal and traces the execution in the direction of the control-flow to approximate the program state at each program point. This is often enough to verify that the assertions hold. The dual approach is to apply backward analysis to propagate properties of the allowable states against the control-flow to infer queries for which the program will not violate any assertion. This paper is a systematic comparison of these two approaches to verification. The paper reports some equivalence results that relate the relative power of various forward and backward analysis frameworks.
We often reach conclusions partially on the basis that we do not have evidence that the conclusion is false. A newspaper story warning that the local water supply has been contaminated would prevent a person from drin...
详细信息
ISBN:
(纸本)354000680X
We often reach conclusions partially on the basis that we do not have evidence that the conclusion is false. A newspaper story warning that the local water supply has been contaminated would prevent a person from drinking water from the tap in her home. This suggests that the absence of such evidence contributes to her usual belief that her water is safe. On the other hand, if a reasonable person received a letter telling her that she had won a million dollars, she would consciously consider whether there was any evidence that the letter was a hoax or somehow misleading before making plans to spend the money. All to often we arrive at conclusions which we later retract when contrary evidence becomes available. The contrary evidence defeats our earlier reasoning. Much of our reasoning is defeasible in this way. Since around 1980, considerable research in AI has focused on how to model reasoning of this sort. In this paper, I describe one theoretical approach to this problem, discuss implementation of this approach as an extension of Prolog, and describe some application of this work to normative reasoning, learning, planning, and other types of automated reasoning.
Domain experts think and reason at a high level of abstraction when they solve problems in their domain of expertise. We present the design and motivation behind a domain specific language, called phi LOG, to enable b...
详细信息
Domain experts think and reason at a high level of abstraction when they solve problems in their domain of expertise. We present the design and motivation behind a domain specific language, called phi LOG, to enable biologists to program solutions to phylogenetic inference problems at a very high level of abstraction. The implementation infrastructure (interpreter, compiler, debugger) for the DSL is automatically obtained through a software engineering framework based on Denotational Semantics and logic programming.
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a convenient formulation of certain problems,...
详细信息
ISBN:
(纸本)3540206426
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logic programming with ordered disjunction. The simulation also supports a broader application of "ordered disjunction", handling problems that would be cumbersome to express using ordered disjunction logic programs. Interestingly, allowing negation as failure in ordered logic programs does not yield any extra computational power: the combination of negation as failure and order can be simulated using order (and true negation) alone.
We investigate the application of abductive logic programming, an existing framework for knowledge representation and reasoning, for specifying the knowledge and behaviour of software agents that need to access resour...
详细信息
ISBN:
(纸本)3540140093
We investigate the application of abductive logic programming, an existing framework for knowledge representation and reasoning, for specifying the knowledge and behaviour of software agents that need to access resources in a global computing environment. The framework allows agents that need resources to join artificial societies where those resources are available. We show how to endow agents with the capability of becoming and ceasing to be members of societies, for different categories of artificial agent societies, and of requesting and being given or denied resources within societies. The strength of our formulation lies in combining the modelling and the computational properties of abductive logic programming for dealing with the issues arising in resource access within artificial agent societies.
In earlier work [91, we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois and minimal negations, calling the resulti...
详细信息
ISBN:
(纸本)0769519180
In earlier work [91, we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois and minimal negations, calling the resulting language XCTL. We define XCTL operators and show that they can be computed using fixpoints. We further discuss how to extend our existing multi-valued model-checker chiChek [8] to reasoning over these logics.
Final Group Projects are an integral part of the graduate mechatronics course, "Introduction to Mechatronics," in the Woodruff School of Mechanical Engineering at Georgia Tech. Students are able to develop b...
详细信息
ISBN:
(纸本)0780377591
Final Group Projects are an integral part of the graduate mechatronics course, "Introduction to Mechatronics," in the Woodruff School of Mechanical Engineering at Georgia Tech. Students are able to develop both practical and theoretical understanding of mechatronics while working on their Final Group Projects. They also develop interpersonal and communication skills necessary to work in a multi-disciplinary field. To assist students, a framework has been developed to help them realize goals they propose for their Final Group Project. It helps them to work effectively within a team environment and present their projects utilizing different media outlets, such as writing technical reports, developing web pages for their Final Group Projects, and making oral presentations. This framework includes lecture topics covered in class, project requirements, grading methods, material resources, and support from graduate teaching assistants, electronic, and machine shop. In this paper, the framework and example projects demonstrating its effectiveness will be presented.
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite universe, without introducing function symbols...
详细信息
ISBN:
(纸本)0769519938
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite universe, without introducing function symbols. We show that this extension is still decidable, and can be used to simulate, on the one hand, answer set programming with a finite universe, and on the other hand, several expressive description logics (DLs), which can be seen as ontology languages. The integration leads to a "best of both worlds": from the LP side it inherits a flexible and intuitive representation of knowledge, whereas the DLs side provides the possibility to represent infinite knowledge.
logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and parallelism. In this work we show that...
详细信息
ISBN:
(纸本)3540206426
logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and parallelism. In this work we show that David H. D. Warren's design for the EAM with Implicit Control does not perform well for deterministic computations and we present several optimisations that allow the BEAM to achieve performance matching or even exceeding related systems. Our optimisations refine the original EAM control rule demonstrate that overheads can be reduced through combined execution rules, and show that a good design and emulator implementation is relevant, even for a complex system such as the BEAM.
This paper considers the problem of synthesizing systems modeled by condition systems into microcontrollers. Condition system, a discrete event system model, can be naturely programmed into microcontrollers. Directly ...
详细信息
ISBN:
(纸本)0780376978
This paper considers the problem of synthesizing systems modeled by condition systems into microcontrollers. Condition system, a discrete event system model, can be naturely programmed into microcontrollers. Directly using incidence matrix and state equation to implement condition systems is not a good method for low-cost microcontrollers because of the lack of certain instructions and limited memory of the microcontrollers. An alternate logic algebra based method is presented and an example condition system is illustrated. By using this method, the corresponding assembly code will be easily created in a systematic way.
暂无评论