| 1. |
|
|
| 2. |
- Eriksson Lundström, Jenny, et al.
(författare)
-
Argumentation as a metacognitive skill of passing acceptance : a case study from a scientific dispute
- 2005
-
Ingår i: Metacognition in computation : papers from the 2005 AAAI symposium. Technical Report SS-05-04. - Menlo Park, California : AAAI Press. - 9781577352303 ; , s. 74-79
-
Konferensbidrag (refereegranskat)abstract
- Automated decision-making is a significant concern for theAI community and especially for multi-agent systems. Although it has long been known among scholars of rhetoric that human decision-making can be systematically influenced by skillful argumentation, there seems to be a lack of formalizations which handle the impact rhetoric has on the concealment of logical fallacies to the human mind. In this paper, we highlight the need of metacognition for the successful formal representation and interpretation of human argumentation and thus successful automated decision-making. The relevance of such investigations is illustrated with a real-world example taken from the discourse of neuroscience.
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Hamfelt, Andreas, et al.
(författare)
-
Inductive Logic Programming with Well-Modedness Constraints
- 1999
-
Ingår i: Proceedings of the 8th International Workshop on Functional and Logic Programming. - : Centre National de la Recherche Scientifique, Institut National Polytechnique de Grenoble, Université Joseph Fourier, Laboratoire Leibniz. ; , s. 220-231
-
Konferensbidrag (refereegranskat)
|
|
| 6. |
- Hamfelt, Andreas, et al.
(författare)
-
Inductive synthesis of logic programs by composition of combinatory program schemes
- 1999
-
Ingår i: LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION. - : SPRINGER-VERLAG BERLIN. ; , s. 143-158
-
Konferensbidrag (refereegranskat)abstract
- Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment COMBINDUCE for inducing well-moded logic programs from examples. The combinators comprise fold combinators for recursio
|
|
| 7. |
- Hamfelt, Andreas, et al.
(författare)
-
Logic Program Synthesis as Problem Reduction using Combining Forms
- 2001
-
Ingår i: JOURNAL OF AUTOMATED SOFTWARE ENGINEERING. - : KLUWER ACADEMIC PUBLISHERS. ; :8, s. 167-193
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents an approach to inductive synthesis of logic programs from examples using problem decomposition and problem reduction principles. This is in contrast to the prevailing logic program induction paradigm, which relies on generalization of
|
|
| 8. |
- Hamfelt, Andreas, et al.
(författare)
-
Towards a logic programming methodology based on higher-order predicates
- 1997
-
Ingår i: NEW GENERATION COMPUTING. - : SPRINGER VERLAG. - 0288-3635. ; 15:4, s. 421-447
-
Tidskriftsartikel (refereegranskat)abstract
- This paper outlines a logic programming methodology which applies standardized logic program recursion forms afforded by a system of general purpose recursion schemes. The recursion schemes are conceived of as quasi higher-order predicates which accept pr
|
|
| 9. |
- Nilsson, Jorgen Fischer, et al.
(författare)
-
Constructing Logic Programs with Higher Order Predicates
- 1995
-
Ingår i: Proceedings of GULP-PRODE'95, the Joint Conference on Declarative Programming. - : Universita' Degli Studi di Salerno, Salerno. ; , s. 307-312
-
Konferensbidrag (refereegranskat)
|
|
