We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstra...
详细信息
ISBN:
(纸本)9783319178226;9783319178219
We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Management of logic variables, unification, and renaming apart is completely elided in favor of algebraic manipulation of variable-free relation expressions. We prove the translation is sound, and the rewriting system complete with respect to traditional SLD semantics.
In this paper, we investigate the use of high-level action languages for representing and reasoning about ethical responsibility in goal specification domains. First, we present a simplified Event Calculus formulated ...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
In this paper, we investigate the use of high-level action languages for representing and reasoning about ethical responsibility in goal specification domains. First, we present a simplified Event Calculus formulated as a logic program under the stable model semantics in order to represent situations within Answer Set programming. Second, we introduce a model of causality that allows us to use an answer set solver to perform reasoning over the agent's ethical responsibility. We then extend and test this framework against the Trolley Problem and the Doctrine of Double Effect. The overarching aim of the paper is to propose a general and adaptable formal language that may be employed over a variety of ethical scenarios in which the agent's responsibility must be examined and their choices determined. Our fundamental ambition is to displace the burden of moral reasoning from the programmer to the program itself, moving away from current computational ethics that too easily embed moral reasoning within computational engines, thereby feeding atomic answers that fail to truly represent underlying dynamics.
The present paper sets the foundation of logic programming in hybridised logics. The basic logic programming semantic concepts such as query and solutions, and the fundamental results such as the existence of initial ...
详细信息
ISBN:
(纸本)9783319281148;9783319281131
The present paper sets the foundation of logic programming in hybridised logics. The basic logic programming semantic concepts such as query and solutions, and the fundamental results such as the existence of initial models and Herbrand's theorem, are developed over a very general hybrid logical system. We employ the hybridisation process proposed by Diaconescu over an arbitrary logical system captured as an institution to define the logic programming framework.
We propose the new logic programming language PrefLog, which is based on an infinite-valued logic in order to support operators for expressing preferences. We demonstrate that if the operators used are continuous over...
详细信息
ISBN:
(纸本)9781450335164
We propose the new logic programming language PrefLog, which is based on an infinite-valued logic in order to support operators for expressing preferences. We demonstrate that if the operators used are continuous over the infinite-valued underlying domain, then the resulting logic programming language retains the well-known properties of classical logic programming (and most notably the existence of a least Herbrand model). We argue that one can define simple and natural new continuous operators by using a small set of operators that are easily shown to be continuous. Finally, we demonstrate that despite the fact that the underlying truth domain and the set of possible interpretations of a PrefLog program are infinite, we can define a terminating bottom-up proof procedure for implementing a significant and useful fragment of the language.
We analyze the relative expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a des...
详细信息
ISBN:
(纸本)9781577357001
We analyze the relative expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional vocabulary A using only atoms from A. While the computational complexity of the two-valued model existence problem for all these languages is (almost) the same, we show that the languages form a neat hierarchy with respect to their expressiveness. We then demonstrate that this hierarchy collapses once we allow to introduce a linear number of new vocabulary elements.
Comingle is a logic programming framework aimed at simplifying the development of applications distributed over multiple mobile devices. Applications are written as a single declarative program (in a system-centric wa...
详细信息
ISBN:
(纸本)9783319192826;9783319192819
Comingle is a logic programming framework aimed at simplifying the development of applications distributed over multiple mobile devices. Applications are written as a single declarative program (in a system-centric way) rather than in the traditional node-centric manner, where separate communicating code is written for each participating node. Comingle is based on committed-choice multiset rewriting and is founded on linear logic. We describe a prototype targeting the Android operating system and illustrate how Comingle is used to program distributed mobile applications. As a proof of concept, we discuss several such applications orchestrated using Comingle.
Network forensics is the science that addresses the capture, recording and analysis of network events and traffic for detecting intrusions and investigating them, attributing blame and supporting a case against potent...
详细信息
Network forensics is the science that addresses the capture, recording and analysis of network events and traffic for detecting intrusions and investigating them, attributing blame and supporting a case against potential intruders in an appropriate court of law. Network forensics involves post mortem investigation of the attack. Forensics investigations are initiated after the attack has happened. Different stages of legal proceedings (such as obtaining a warrant or evidence to the jury) require reconstructing an attack scenario from an attacked system with varying degrees of certainty. In order to present the scenario that can be best supported by evidence, digital forensic investigators analyze all possible attack scenarios reconstructed from the available evidence. The analysis phase also assigns some indication of possibilities, including an odds ratio for each potential attack. Modern-day attackers tend to use sophisticated multi-stage/multi-host attack techniques and anti-forensics tools to cover their attack traces. Due to the limitations of current intrusion detection systems and forensic analysis tools, reconstructing attack scenarios from evidence left behind by the attackers of an enterprise system is challenging. In particular, reconstructing attack scenarios by using evidence including intrusion detection system (IDS) alerts and system logs that have too many false positives is a challenge. In this dissertation, I present a model and an accompanying software tool that systematically address how to resolve the above problems to reconstruct attack scenarios that could stand up in a court of law. These problems include using large amounts of data including irrelevant data and relevant data that should have been present but cannot be found due to one or many causes. In this dissertation, such kind of relevant data that should been present but cannot be found is called missing evidence or incomplete evidence destroyed by attackers’ using anti-forensic techni
The compliance verification task amounts to establishing if the execution of a system, given in terms of observed events, does re-spect a given property. In the past both the frameworks of Temporal logics and logic Pr...
详细信息
The compliance verification task amounts to establishing if the execution of a system, given in terms of observed events, does re-spect a given property. In the past both the frameworks of Temporal logics and logic programming have been extensively exploited to as-sess compliance. In this work we review the LTL and the Abductive logic programming frameworks in the light of compliance evaluation, and formally investigate the relationship between the two approaches. We define a notion of compliance within each approach, and then we show that an arbitrary LTL formula can be expressed in SCIFF, by pro-viding an automatic translation procedure from LTL to SCIFF which preserves compliance.
The special issue of Theory and Practice of logic programming (TPLP) consists of the regular papers accepted for presentation at International Conference of logic programming (ICLP) 2015. Altogether 89 submissions of ...
详细信息
The special issue of Theory and Practice of logic programming (TPLP) consists of the regular papers accepted for presentation at International Conference of logic programming (ICLP) 2015. Altogether 89 submissions of abstracts were received of which 74 resulted in submissions of papers. The program chairs, acting as guest editors of this special issue, organized the refereeing process with the help of the program committee and external reviewers. Each paper was reviewed by at least three anonymous referees who provided full written evaluations. The paper Complexity and Compilation of GZ-Aggregates in Answer Set programming, by Mario Alviano and Nicola Leone, was awarded the ICLP 2015 Best Paper Prize. In addition to the presentations of accepted papers, the technical program of ICLP 2015 included two panels, on The Future Publication of ICLP Proceedings, chaired by Torsten Schaub, and Teaching Computer Science and Declarative programming in Schools and Universities, chaired by Manuel Hermenegildo.
logic programming provides a declarative framework for modeling and solving many combinatorial problems. Until recently, it was not competitive with state of the art planning techniques partly due to search capabiliti...
详细信息
logic programming provides a declarative framework for modeling and solving many combinatorial problems. Until recently, it was not competitive with state of the art planning techniques partly due to search capabilities limited to backtracking. Recent development brought more advanced search techniques to logic programming such as tabling that simplifies implementation and exploitation of more sophisticated search algorithms. Together with rich modeling capabilities this progress brings tabled logic programing on a par with current best planners. The paper brings an initial experimental study comparing various approaches to search for sequential plans in the Picat planning module.
暂无评论