Habermas,lifelong learning and citizenship education

Citizenship and its education is again gaining importance in many countries. This paper uses England as its primary example to develop a Habermasian perspective on this issue. The statutory requirements for citizenship education in England imply that significant attention be given to the moral and social development of the learner over time, to the active engagement of the learner in community and to the knowledge skills and understanding necessary for political action. This paper sets out a theoretical framework that offers a perspective on learning suitable for these far-reaching aims. We argue that schools need to shift from the currently dominant discourse of accountability to incorporate a discourse of care in order to make room for an effective and appropriate pedagogy for citizenship. Habermas’s social theory gives us a theoretical framework that properly locates schools within the lifeworld as part of civil society. Schools should therefore attend to hermeneutical and emancipatory concerns, not only to strategic interests. We put these in the context of Habermas’s social theory to paint an alternative vision learning for citizenship education which is based in developing the dispositions, values and attitudes necessary for lifelong learning with a view to developing ongoing communicative action.

Towards a theory of intention revision

Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importantly, intentions are very closely connected with other mental states—in particular, beliefs about the future and the abilities of the agent. So, we cannot study them in isolation. We must consider the interplay between intention revision and the revision of other mental states, which complicates the picture considerably. In this paper, we present some first steps towards a theory of intention revision. We develop a simple model of an agent’s mental states, and define intention revision operators. Using this model, we develop a logic of intention dynamics, and then investigate some of its properties.     

Steps Toward a Computational Metaphysics

In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in prover9’s first-order syntax, and (2) how prover9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research.     

A Note on Binary Inductive Logic

We consider the problem of induction over languages containing binary relations and outline a way of interpreting and constructing a class of probability functions on the sentences of such a language. Some principles of inductive reasoning satisfied by these probability functions are discussed, leading in turn to a representation theorem for a more general class of probability functions satisfying these principles.     

Consistency Defaults

A consistency default is a propositional inference rule that asserts the consistency of a formula in its consequence. Consistency defaults allow for a straightforward encoding of domains in which it is explicitely known when something is possible. The logic of consistency defaults can be seen as a variant of cumulative default logic or as a generalization of justified default logic; it is also able to simulate Reiter default logic in the seminormal case. A semantical characterization of consistency defaults in terms of processes and in terms of a fixpoint equation is given, as well as a normal form. Presented by Melvin Fitting     

基于外域范例可拓推理的研究

基于范例推理(CBR)是人类常用的一种解决问题方式,也是人工智能的一种研究范式,在许多领域都得到了应用。但CBR也可能受到心理定势和负迁移的影响,对于创造性思维有一定的负面作用。研究对CBR进行了改进,提出了在外域搜索范例并作可拓变换的方法,称为基于外域范例的可拓推理,并将它运用到产品创新构思系统的设计中,为把认知心理学应用到国家经济建设中提供了新思路。     

对归纳推理非对称性现象的特征迁移解释

作者创新提出对归纳推理非对称性现象的特征迁移解释,认为根据由前提类别已知的特征集合构成的特征样本中迁移出现在结论类别中的特征的比例,能预测作为新特征的归纳特征由前提类别迁移到结论类别的可能性。以大学生为被试的实验结果支持对非对称性现象的特征迁移解释而不是原来的两种相似性解释。     

Pandora: A Reasoning Toolbox using Natural Deduction Style

Pandora is a tool for supporting the learning of first ordernatural deduction. It includes a help window, an interactivecontext sensitive tutorial known as the "e-tutor" and facilitiesto save, reload and export to LATEX. Every attempt to applya natural deduction rule is met with either success or a helpfulerror message, providing the student with instant feedback.Detailed electronic logs of student usage are recorded for evaluationpurposes. This paper describes the basic functionality, thee-tutor, our experiences of using the tool in teaching and ourfuture plans.     

Open answer set programming for the semantic web

We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reasoners are available.We argue that extended forest logic programming is a useful tool for uniformly representing and reasoning with both ontological and rule-based knowledge, as they can capture a large fragment of the OWL DL ontology language equipped with DL-safe rules. Furthermore, EFoLPs enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web.