New frontiers in artificial intelligence

InhaltsverzeichnisJuris-Informatics.Third International Workshop on Juris-Informatics.Using BATNAs and WATNAs in Online Dispute Resolution.Thai Succession and Family Law Ontology Building Using Ant Colony Algorithm.Reflective Visualization of the Agreement Quality in Mediation.Implementing Temporal Defeasible Logic for Modeling Legal Reasoning.Evaluating Cases in Legal Disputes as Rival Theories.Law-Aware Access Control: About Modeling Context and Transforming Legislation.Knowledge Collaboration in Software Development.3rd International Workshop on Supporting Knowledge Collaboration in Software Development (KCSD2009).On the Central Role of Mailing Lists in Open Source Projects: An Exploratory Study.A Proposal of TIE Model for Communication in Software Development Process.Identifying the Concepts That Are Searchable with Keywords in Code Search Engines.On the Use of Emerging Design as a Basis for Knowledge Collaboration.A Time-Lag Analysis for Improving Communication among OSSDevelopers.Comparison of Coordination Communication and Expertise Communication in Software Development: Motives, Characteristics, and Needs.Logic and Engineering of Natural Language Semantics.6th International Workshop on Logic and Engineering of Natural Language Semantics (LENLS 6).Representing Covert Movements by Delimited Continuations.Problems with Intervention and Binding into Relations.A Translation from Logic to English with Dynamic Semantics.Semantics of Possibility Suffix “(Rar)e”.An Adaptive Logic for the Formal Explication of Scalar Implicatures.Two Kinds of Procedural Semantics for Privative Modification.On the Nature and Formal Analysis of Indexical Presuppositions.Non-standard Uses of German 1st Person Singular Pronouns.Learning with Logics and Logics for Learning.The Sixth Workshop on Learning with Logics and Logics for Learning (LLLL2009).Inferability of Unbounded Unions of Certain Closed Set Systems.Mining Frequent k-Partite Episodes from Event Sequences.Learning from Positive Data Based on the MINL Strategy with Refinement Operators.Computing Minimal Models by Positively Minimal Disjuncts.