Observation-based Defeasible Logic Programming
Analyzing the defeat relation in observation-based defeasible logic programming
... In this work we analyze the problem of incorporating specificity to characterize defeat in a particular argumentative framework, called Observation Based Defeasible Logic Programming, ...
10
Characterizing defeat in observation-based defeasible logic programming
... In this work we analyze the problem of incorporating specificity to characterize defeat in a particular argumentative framework, called observation based defeasible logic programming ( ...
5
Modelling derivation in defeasible logic programming with perceptron-based neural networks
... is based on the language of logic ...of logic programming, and represent the knowledge an agent has about the world; more for- mally, an observation is a grounded literal L representing ...
12
An approach for Temporal Argumentation Using Labeled Defeasible Logic Programming (l-DeLP)
... feasible Logic Programming (DeLP - [8]), a formal- ism that combines results of Logic Programming and Defeasible ...a defeasible argu- mentation inference mechanism for ...
8
Combining counterpropagation neural networks and defeasible logic programming for text classification
... It must be remarked that the approach presented in this paper can be seen as a particular case of how frameworks for defeasible argumentation can be integrated them machine learning techniques. Part of our current ...
5
Local-as-view integration of ontologies in defeasible logic programming
... imal non-contradictory set of ground defeasible clauses A of ∆ that allows to derive a ground literal H possibly using ground rules of Π. Since arguments may be in conflict (concept captured in terms of a logical ...
10
Assuring safety in an air traffic control system with defeasible logic programming
... with adaptive systems, in which it is necessary to handle continuous changes. As traditional methods are not very effective in this, argument-based safety cases offer a plausible alternative basis for ...
8
An approach for an algebra applied to a defeasible logic programming
... DeLP provides an argumentation based mechanism to determine warranted conclusions. This procedure involves constructing arguments from programs, identifying conflicts or attacks among arguments, evaluating pairs ...
10
A first approach to abductive defeasible logic programming: formalization and properties
... Defeasible Logic Programming (DeLP) combines results of Logic Programming and Defeasible Ar- ...non- defeasible information and are denoted L 0 ← L 1 , ...
12
Integrating defeasible argumentation with fuzzy ART neural networks for pattern classification
... use defeasible rules for revising a neu- ral network classification a ...a defeasible theory from a set of training ...ble logic theory is assumed to be ...a defeasible theory from examples; ...
7
The Gödel and the Splitting Translations
... I of beliefs. The aim is to capture a set which contains I, is closed under positive and negative introspection, is closed under logical deduction and does not contain anything superfluous. One way to obtain such a set ...
30
Representing generalization relationships in logic programming
... Reasoning about class hierarchies means to deduce properties for the instances of a class starting from the information of classes and the inheritance relationship. In fact, the paradigmatic example of the non-monotonic ...
12
Strong properties of circumscriptive logic programming
... aspLitc is definite, it has a minimal Herbrand model MpLltc. When we mention a circumscriptive logic program P without any reference to a language, ｷｻｾ＠ will.consider the[r] ...
13
Weak properties of circumscriptive logic programming
... 'HFODUDWLYH VHPDQWLFV IRU QRUPDO ORJLF SURJUDPV ORJLF SURJUDPV ZLWK QHJDWLYH OLWHUDOV LQ WKH ERG\ RI WKH FODXVHV KDYH EHHQ LQWURGXFHG VLQFH WKH nUVW LPSOHPHQWDWLRQ RI 352/2* %HLQJ ORJLF [r] ...
14
TítuloA casual semantics for Logic Programming
... necessity- based approaches have been focused on determining the actual causes of an event without putting too much attention to problems of elaboration toler- ance; on the other hand, the sufficiency-based ...
341
Visualization designs for constraint logic programming
... Although there is no elimination procedure similar to that of linear equations over the reals, a set of equations in finite domains can always be decided to have or not solution, ultim[r] ...
12
A framework for assertion-based debugging in constraint logic programming
... Given the lack at this point of a standardized set of benchmarks including assertions, for our preliminary evaluation we have opted for a simple and repeatable method of generating ass[r] ...
13
Chapter 15 & 16 updated
... • Symbolic logic provides basis for logic programming • Logic programs should be nonprocedural. • Although there are a number of drawbacks with the current state of logic programming it[r] ...
30
Integration of rules and ontologies with defeasible logic programming
... The Semantic Web [1] (SW) is a vision of the current Web where resources have exact meaning assigned in terms of ontologies [2], thus enabling agents to reason about them. The Ontology Layer of the SW is well developed ...
10
Parallel construction of dialectical trees for defeasible logic programming
... Following the parallel execution model for building the marked dialectical tree, every time a processor finish the construction of an argument A, the P-JAM instruction prepare_par[r] ...
8
