scholarly journals Conflict Resolution in Structured Argumentation

10.29007/brgz ◽  
2018 ◽  
Author(s):  
Martin Baláž ◽  
Jozef Frtús ◽  
Martin Homola
Keyword(s):  
Conflict Resolution ◽  
Logic Programming ◽  
Inference Rules ◽  
Logic Programs ◽  
Defeasible Logic ◽  
Structured Argumentation ◽  
Conflict Resolutions

While several interesting argumentation-based semantics fordefeasible logic programs have been proposed, to our bestknowledge, none of these approaches is able to fully handle theclosure under strict rules in a sufficient manner: they are eithernot closed, or they use workarounds such as transposition of ruleswhich violates the desired directionality of logic programmingrules.We propose a novel argumentation-based semantics, in which thestatus of arguments is determined by attacks between newlyintroduced conflict resolutions instead of attacks betweenarguments. We show that the semantics is closed w.r.t. strictrules and respects the directionality of inference rules, as wellas other desired properties previously published in theliterature.

scholarly journals Interdefinability of defeasible logic and logic programming under the well-founded semantics

2011 ◽  
Vol 13 (1) ◽  
pp. 107-142 ◽  
Author(s):  
FREDERICK MAIER
Keyword(s):  
Logic Programming ◽  
Opposite Direction ◽  
Stable Model ◽  
Logic Programs ◽  
Defeasible Logic ◽  
Normal Logic

AbstractWe provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond–Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories.

A Modal Semantics of Negation in Logic Programming

1992 ◽  
Vol 16 (3-4) ◽  
pp. 231-262
Author(s):  
Philippe Balbiani
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Modal Logics ◽  
Kripke Models ◽  
Logic Programs ◽  
Modal Semantics ◽  
Soundness And Completeness ◽  
Modal Completion ◽  
Well Foundedness

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.

scholarly journals Learning Large Logic Programs By Going Beyond Entailment

2020 ◽  
Author(s):  
Andrew Cropper ◽  
Sebastijan Dumančic
Keyword(s):  
Logic Programming ◽  
Loss Function ◽  
Inductive Logic Programming ◽  
State Of The Art ◽  
Inductive Logic ◽  
Program Synthesis ◽  
Loss Functions ◽  
Logic Programs ◽  
Binary Decision ◽  
Best First Search

A major challenge in inductive logic programming (ILP) is learning large programs. We argue that a key limitation of existing systems is that they use entailment to guide the hypothesis search. This approach is limited because entailment is a binary decision: a hypothesis either entails an example or does not, and there is no intermediate position. To address this limitation, we go beyond entailment and use 'example-dependent' loss functions to guide the search, where a hypothesis can partially cover an example. We implement our idea in Brute, a new ILP system which uses best-first search, guided by an example-dependent loss function, to incrementally build programs. Our experiments on three diverse program synthesis domains (robot planning, string transformations, and ASCII art), show that Brute can substantially outperform existing ILP systems, both in terms of predictive accuracies and learning times, and can learn programs 20 times larger than state-of-the-art systems.

scholarly journals Defeasible logic versus Logic Programming without Negation as Failure

2000 ◽  
Vol 42 (1) ◽  
pp. 47-57 ◽  
Author(s):  
G. Antoniou ◽  
M.J. Maher ◽  
D. Billington
Keyword(s):  
Logic Programming ◽  
Defeasible Logic ◽  
Negation As Failure

Conflict resolution using logic programming

2003 ◽  
Vol 15 (1) ◽  
pp. 244-249 ◽  
Author(s):  
J. Chomicki ◽  
J. Lobo ◽  
S. Naqvi
Keyword(s):  
Conflict Resolution ◽  
Logic Programming

Conflict Resolution in E-HRM Environments

2009 ◽  
pp. 178-184
Author(s):  
Joseph Abiodun Bello ◽  
Adeniji Anthonia Adenike
Keyword(s):  
Conflict Resolution ◽  
Problem Solving ◽  
Human Resource ◽  
Human Interaction ◽  
International Conflicts ◽  
Organizational Processes ◽  
The World ◽  
Conflict Resolutions ◽  
Distributive Bargaining ◽  
Conducive Environment

There have been studies on conflict resolutions but many focused on regional inter-tribe and international conflicts between or among nations of the world. Only very few have written about industrial conflict recently, even these few did not touch the mechanism of resolving conflicts in the organization in depth. Therefore, this article will focus on various conflict resolution mechanisms and the three major models of conflict resolutions—namely distributive bargaining, integrated bargaining, and interactive problem solving as given by Cross, Susan, Rosenthal, and Robert (1999). To do this effectively, we will explore the available literature on the antecedents of conflicts in human resource systems. Varieties of views and notions held by individuals and groups in respect of the role and the consequences of conflicts in the functioning of humans in our modern complex organizations will be considered. The consequences of conflicts on interpersonal, inter-group, and inter-organizational processes, when conflict may empower, distress, or lubricate the wheels of human interaction in the context of human resource management will be traced. The views of experts, professionals and academicians on how and why conflicts should be handled to ensure a healthier and conducive environment to work will be traced.

scholarly journals onlineSPARC: A Programming Environment for Answer Set Programming

2018 ◽  
Vol 19 (2) ◽  
pp. 262-289 ◽  
Author(s):  
ELIAS MARCOPOULOS ◽  
YUANLIN ZHANG
Keyword(s):  
High School Students ◽  
Logic Programming ◽  
Answer Set Programming ◽  
Programming Environment ◽  
Logic Programs ◽  
School Students ◽  
Major Barrier ◽  
Simple Interface ◽  
Answer Sets ◽  
Answer Set

AbstractRecent progress in logic programming (e.g. the development of the answer set programming (ASP) paradigm) has made it possible to teach it to general undergraduate and even middle/high school students. Given the limited exposure of these students to computer science, the complexity of downloading, installing, and using tools for writing logic programs could be a major barrier for logic programming to reach a much wider audience. We developed onlineSPARC, an online ASP environment with a self-contained file system and a simple interface. It allows users to type/edit logic programs and perform several tasks over programs, including asking a query to a program, getting the answer sets of a program, and producing a drawing/animation based on the answer sets of a program.

scholarly journals Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME

2019 ◽  
Vol 33 ◽  
pp. 3052-3059 ◽  
Author(s):  
Farhad Shakerin ◽  
Gopal Gupta
Keyword(s):  
Logic Programming ◽  
Inductive Logic Programming ◽  
State Of The Art ◽  
Inductive Logic ◽  
Nonmonotonic Logic ◽  
Global Behavior ◽  
Logic Programs ◽  
Tree Models ◽  
Boosted Tree ◽  
Classification Evaluation

We present a heuristic based algorithm to induce nonmonotonic logic programs that will explain the behavior of XGBoost trained classifiers. We use the technique based on the LIME approach to locally select the most important features contributing to the classification decision. Then, in order to explain the model’s global behavior, we propose the LIME-FOLD algorithm —a heuristic-based inductive logic programming (ILP) algorithm capable of learning nonmonotonic logic programs—that we apply to a transformed dataset produced by LIME. Our proposed approach is agnostic to the choice of the ILP algorithm. Our experiments with UCI standard benchmarks suggest a significant improvement in terms of classification evaluation metrics. Meanwhile, the number of induced rules dramatically decreases compared to ALEPH, a state-of-the-art ILP system.

Sign in / Sign up

Export Citation Format

Share Document