We present Java Sensei, an Intelligent Learning Environment (ILE) for learning Java programming. the ILE is formed by an affective tutoring system working in a Web environment. the tutoring system was implemented unde...
详细信息
We present Java Sensei, an Intelligent Learning Environment (ILE) for learning Java programming. the ILE is formed by an affective tutoring system working in a Web environment. the tutoring system was implemented under different learning methodologies like problem-solving for the pedagogical module, knowledge space for the expert module, and overlays for the student module. the main contribution of this work was the integration of cognitive and affective information in a behavior graph which is used by the pedagogical agent to show emotion and empathy to the student.
Hierarchical representations are common in many artificialintelligence tasks, such as classification of satellites in orbit. Representing and reasoning on hierarchies is difficult, however, as they can be large, deep...
详细信息
ISBN:
(纸本)9781479974047
Hierarchical representations are common in many artificialintelligence tasks, such as classification of satellites in orbit. Representing and reasoning on hierarchies is difficult, however, as they can be large, deep and constantly evolving. Although probabilistic programming provides the flexibility to model many situations, current probabilistic programming languages (PPL) do not adequately support hierarchical reasoning. We present a novel PPL approach to representing and reasoning about hierarchies that utilizes references, enabling unambiguous access and referral to hierarchical objects and their properties. We demonstrate the benefits of our approach on a real-world resident space object hierarchy.
the proceedings contain 35 papers. the special focus in this conference is on Automated Technology for Verification and Analysis. the topics include: Probabilistic programming;machines reasoning about machines;using S...
ISBN:
(纸本)9783319249520
the proceedings contain 35 papers. the special focus in this conference is on Automated Technology for Verification and Analysis. the topics include: Probabilistic programming;machines reasoning about machines;using SMT for solving fragments of parameterised boolean equation systems;unfolding-based process discovery;improving interpolants for linear arithmetic;a mechanically checked generation of correlating programs directed by structured syntactic differences;on automated lemma generation for separation logic with inductive definitions;severity levels of inconsistent code;learning the language of error;explicit model checking of very large MDP using partitioning and secondary storage;model checking failure-prone open systems using probabilistic automata;optimal continuous time markov decisions;spanning the spectrum from safety to liveness;a tool for verifying properties of hidden markov models;an automatic framework for proving parameterized cache coherence protocols;an approximate steady-state analyser of probabilistic boolean networks;digital evidence for android;boosting sequentialization-based verification of multi-threaded c programs via symbolic pruning of redundant schedules;a contextual equivalence checker for IMJ;trace diagnostics using temporal implicants;test case generation of actor systems;lattice-based semantics for combinatorial model evolution;effective verification of replicated data types using later appearance records;TSO-to-TSO linearizability is undecidable;formal verification of infinite-state BIP models;symbolic slicing for the verification of concurrent programs and on the complexity of model-checking branching and alternating-time temporal logics in one-counter systems.
the 30th edition of the internationalconference of logicprogramming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiati...
详细信息
the 30th edition of the internationalconference of logicprogramming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiative in 2010 taken by the Association for logicprogramming and Cambridge University Press, the full papers accepted for the internationalconference on logicprogramming again appear as a special issue of theory and Practice of logicprogramming (TPLP) - the 30thinternationalconference on logicprogramming Special Issue. Papers describing original, previously unpublished research and not simultaneously submitted for publication elsewhere were solicited in all areas of logicprogramming including but not restricted to: theory: Semantic Foundations, Formalisms, Non- monotonic reasoning, Knowledge Representation; Implementation: Compilation, Memory Management, Virtual Machines, Parallelism; Environments: Program Analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing; Language Issues: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, programming Techniques; Related Paradigms: Abductive logicprogramming, Inductive logicprogramming, Constraint logicprogramming, Answer-Set programming; Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, artificialintelligence, Bioinformatics.
the past mineral deposit prediction expert systems cannot support nonmonotonic reasoning. this article introduces answer set programming, which is a well-known formalism in artificialintelligence, to design an expert...
详细信息
ISBN:
(纸本)9781467376648
the past mineral deposit prediction expert systems cannot support nonmonotonic reasoning. this article introduces answer set programming, which is a well-known formalism in artificialintelligence, to design an expert system for mineral deposit prediction. the system includes GIS spatial database, fact generator, temporary fact library, fact management module, knowledge based management module, knowledge base, reasoning machine, and explanation module. the incomplete deposit knowledge and nonmonotonic reasoning is supported in the system. To demonstrate the feasibility of our approach, we illustrate how to represent deposit information in the form of logic programs and how to make reasoning according to the answer set semantics by an example of the prospecting model of porphyrite iron. the processing of ore deposit predicting is a typical example of nonmonotonic reasoning. As we got more information, we found that the original conclusion was wrong, then we revised our conclusion. Such behavior is supported in our system but is not supported in previous similar systems.
the proceedings contain 34 papers. the topics discussed include: automatic inference of resource consumption bounds;matrix interpretations for polynomial derivational complexity of rewrite systems;parameterized comple...
ISBN:
(纸本)9783642287169
the proceedings contain 34 papers. the topics discussed include: automatic inference of resource consumption bounds;matrix interpretations for polynomial derivational complexity of rewrite systems;parameterized complexity and fixed-parameter tractability of description logicreasoning;enfragmo: a system for modeling and solving search problems withlogic;automated and human proofs in general mathematics: an initial comparison;lazy abstraction with interpolants for arrays;backward trace slicing for conditional rewrite theories;forgetting for defeasible logic;solving language equations and disequations with applications to disunification in description logics and monadic set constraints;dual-priced modal transition systems with time durations;finding finite herbrand models;and monitor-based statistical model checking for weighted metric temporal logic.
Extensional higher-order logicprogramming has been recently proposed as an interesting extension of classical logicprogramming An important characteristic of the new paradigm is that it preserves all the well-known ...
详细信息
Extensional higher-order logicprogramming has been recently proposed as an interesting extension of classical logicprogramming An important characteristic of the new paradigm is that it preserves all the well-known properties of traditional logicprogramming In this paper we enhance extensional higher-order logicprogramming with constructive negation. We argue that the main ideas underlying constructive negation are quite close to the existing proof procedure for extensional higher-order logicprogramming and for this reason the two notions amalgamate quite conveniently. We demonstrate the soundness of the resulting proof procedure and describe an actual implementation of a language that embodies the above ideas. In this way we obtain the first (to our knowledge) higher-order logicprogramming language supporting constructive negation and offering a new style of programmingthat genuinely extends that of traditional logicprogramming.
this paper presents Tweety, an open source project for scientific experimentation on logical aspects of artificialintelligence and particularly knowledge representation. Tweety provides a general framework for implem...
详细信息
this paper presents Tweety, an open source project for scientific experimentation on logical aspects of artificialintelligence and particularly knowledge representation. Tweety provides a general framework for implementing and testing knowledge representation formalisms in a way that is familiar to researchers used to logical formalizations. this framework is very general, widely applicable, and can be used to implement a variety of knowledge representation formalisms from classical logics, over logicprogramming and computational models for argumentation, to probabilistic modeling approaches. Tweety already contains over 15 different knowledge representation formalisms and allows easy computation of examples, comparison of algorithms and approaches, and benchmark tests. this paper gives an overview on the technical architecture of Tweety and a description of its different libraries. We also provide two case studies that show how Tweety can be used for empirical evaluation of different problems in artificialintelligence.
In the past, there have been several attempts to explain logicprogramming under the well-founded semantics as a logic of inductive definitions. A weakness in all is the absence of an obvious connection between how we...
详细信息
In the past, there have been several attempts to explain logicprogramming under the well-founded semantics as a logic of inductive definitions. A weakness in all is the absence of an obvious connection between how we understand various types of informal inductive definitions in mathematical text and the complex mathematics of the well-founded semantics. In this paper, we close this gap. We formalize the induction process in the most common principles and prove that the well-founded model construction generalizes them all.
Reiter's original proposal for default logic is unsatisfactory for open default theories because of Skolemization and grounding. In this paper, we reconsider this long-standing problem and propose a new world view...
详细信息
Reiter's original proposal for default logic is unsatisfactory for open default theories because of Skolemization and grounding. In this paper, we reconsider this long-standing problem and propose a new world view semantics for first-order default logic. Roughly speaking, a world view of a first-order default theory is a maximal collection of structures satisfying the default theory where the default part is fixed by the world view itself. We show how this semantics generalizes classical first-order logic and first-order answer set programming, and we discuss its connections to Reiter's semantics and other related semantics. We also argue that first-order default logic under the world view semantics provides a rich framework for integrating classical logic based and rule based formalisms in the first-order case.
暂无评论