Keywords:
Electronic books.
Type of Medium:
Online Resource
Pages:
1 online resource (1056 pages)
Edition:
1st ed.
ISBN:
9781614990987
Series Statement:
Frontiers in Artificial Intelligence and Applications Series ; v.242
URL:
https://ebookcentral.proquest.com/lib/geomar/detail.action?docID=5161934
DDC:
006.30940072
Language:
English
Note:
Title Page -- Introduction -- Conference Organization, Sponsorship and Support -- Invited Speakers -- ECAI Area Chairs, ECAI Program Committee -- PAIS Program Committee, System Demonstrations Track -- Contents -- Keynote Talks -- Probabilistic Techniques for Mobile Robot Navigation -- Generalized Decision Diagrams: The Game Is Not Over Yet! -- Never Ending Learning -- Bad Equilibria (and what to Do About Them) -- Frontiers of Artificial Intelligence -- Executable Logic for Dialogical Argumentation -- Computational Creativity: The Final Frontier? -- Recent Advances in Imprecise-Probabilistic Graphical Models -- Lifted Probabilistic Inference -- Developmental Mechanisms for Autonomous Life-Long Learning in Robots -- Robot Skill Learning -- ECAI Long Papers -- Conservative Social Laws -- Finding and Proving the Optimum: Cooperative Stochastic and Deterministic Search -- DL-Lite with Attributes and Datatypes -- Towards a Complete Classical Music Companion -- LoCo - A Logic for Configuration Problems -- Using Learning to Rank Approach for Parallel Corpora Based Cross Language Information Retrieval -- Macros, Reactive Plans and Compact Representations -- From Macro Plans to Automata Plans -- Multirelational Consensus Clustering with Nonnegative Decompositions -- Verification of Description Logic Knowledge and Action Bases -- Nested Monte-Carlo Tree Search for Online Planning in Large MDPs -- Markov Constraints for Generating Lyrics with Style -- Trust-Based Solution for Robust Self-Configuration of Distributed Intrusion Detection Systems -- What Does It Take to Enforce an Argument? Minimal Change in Abstract Argumentation -- The Possible Winner Problem with Uncertain Weights -- Representing Value Functions with Recurrent Binary Decision Diagrams.
,
An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization -- Hybrid Possibilistic Conditioning for Revision Under Weighted Inputs -- Three-Valued Possibilistic Networks -- Implementing and Evaluating Provers for First-Order Modal Logics -- Heuristically Accelerated Reinforcement Learning: Theoretical and Experimental Results -- Learning Rules of Simplified Boardgames by Observing -- A Reinforcement-Learning Algorithm for Sampling Design in Markov Random Fields -- A Protocol Based on a Game-Theoretic Dilemma to Prevent Malicious Coalitions in Reputation Systems -- Iterative Algorithm for Solving Two-Player Zero-Sum Extensive-Form Games with Imperfect Information -- Interval Temporal Logics over Finite Linear Orders: The Complete Picture -- Natural Language Arguments: A Combined Approach -- Preference Extraction from Negotiation Dialogues -- Planning as Quantified Boolean Formula -- Speeding Up 2-Way Number Partitioning -- An Efficient and Adaptive Approach to Negotiation in Complex Environments -- Combining DRA and CYC into a Network Friendly Calculus -- On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements -- Ideal Point Guided Iterative Deepening -- Opportunistic Branched Plans to Maximise Utility in the Presence of Resource Uncertainty -- A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence -- Compression-Based AODE Classifiers -- Bounded Single-Peaked Width and Proportional Representation -- When Intelligence Is Just a Matter of Copying -- Context-Aware Access Control for RDF Graph Stores -- Decision-Making with Sugeno Integrals: DMU vs. MCDM -- An Analysis of Chaining in Multi-Label Classification -- A Study of Local Minimum Avoidance Heuristics for SAT.
,
Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction -- Preferring Properly: Increasing Coverage While Maintaining Quality in Anytime Temporal Planning -- Weighted Manipulation for Four-Candidate Llull Is Easy -- Agent Strategies for ABA-Based Information-Seeking and Inquiry Dialogues -- Guiding User Choice During Discussion by Silence, Examples and Justifications -- Combining Bootstrapping and Feature Selection for Improving a Distributional Thesaurus -- Argumentation-Based Reinforcement Learning for RoboCup Soccer Keepaway -- Case-Based Planning for Problems with Real-Valued Fluents: Kernel Functions for Effective Plan Retrieval -- A Bayesian Multiple Kernel Learning Framework for Single and Multiple Output Regression -- Approximate Tradeoffs on Matroids -- Process Discovery via Precedence Constraints -- Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary -- Partial Cooperation in Multi-Agent Local Search -- Towards Generalizing the Success of Monte-Carlo Tree Search Beyond the Game of Go -- Complexity of Branching Temporal Description Logics -- Online Voter Control in Sequential Elections -- Planning with Semantic Attachments: An Object-Oriented View -- Comparator Selection for RPC with Many Labels -- An Anytime Algorithm for Finding the epsilon-Core in Nontransferable Utility Coalitional Games -- Spectrum Enhanced Dynamic Slicing for Better Fault Localization -- SAT vs. Search for Qualitative Temporal Reasoning -- Symmetries in Itemset Mining -- Concepts, Agents, and Coalitions in Alternating Time -- Large-Scale Interactive Ontology Matching: Algorithms and Implementation -- Characterization of Positive and Negative Information in Comparative Preference Representation -- A Ranking Semantics for First-Order Conditionals -- A New Approach to the Snake-In-The-Box Problem.
,
Delegating Decisions in Strategic Settings -- Reconciling OWL and Non-Monotonic Rules for the Semantic Web -- Hybrid Regression-Classification Models for Algorithm Selection -- Justifying Dominating Options when Preferential Information Is Incomplete -- Fixed-Parameter Algorithms for Closed World Reasoning -- Efficient Reasoning in Multiagent Epistemic Logics -- Knowledge-Based Programs as Plans - The Complexity of Plan Verification -- A Path-Optimal GAC Algorithm for Table Constraints -- Updating Inconsistent Description Logic Knowledge Bases -- Almost-Truthful Mechanisms for Fair Social Choice Functions -- Choosing Combinatorial Social Choice by Heuristic Search -- Creating Features from a Learned Grammar in a Simulated Student -- Width and Serialization of Classical Planning Problems -- Game-Theoretic Approach to Adversarial Plan Recognition -- Here, There, but Not Everywhere: An Extended Framework for Qualitative Constraint Satisfaction -- Inconsistency Handling in Datalog+/- Ontologies -- Fair Division of Indivisible Goods Under Risk -- Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking -- Efficient Norm Emergence Through Experiential Dynamic Punishment -- On Computing Correct Processes and Repairs Using Partial Behavioral Models -- Routing for Continuous Monitoring by Multiple Micro UAVs in Disaster Scenarios -- Diagnosing Delays in Multi-Agent Plans Execution -- Improving Video Activity Recognition Using Object Recognition and Text Mining -- Exploiting Expert Knowledge in Factored POMDPs -- Combining Voting Rules Together -- ExpExpExplosion: Uniform Interpolation in General EL Terminologies -- Tunneling and Decomposition-Based State Reduction for Optimal Planning -- Extending Set-Based Dualization: Application to Pattern Mining -- Nearness Rules and Scaled Proximity.
,
Discovering Cross-Language Links in Wikipedia Through Semantic Relatedness -- Optimizations for the Boolean Approach to Computing Minimal Hitting Sets -- Hierarchical and Overlapping Co-Clustering of mRNA:miRNA Interactions -- A Robust Approach to Addressing Human Adversaries in Security Games -- Solving Raven's IQ-Tests: An AI and Cognitive Modeling Approach -- Best Reply Dynamics for Scoring Rules -- Complexity of Conditional Planning under Partial Observability and Infinite Executions -- Engineering Efficient Planners with SAT -- Coordinated Exploration with a Shared Goal in Costly Environments -- Strategic and Epistemic Reasoning for the Game Description Language GDL-II -- Deciding Membership in a Class of Polyhedra -- Multiple-Outcome Proof Number Search -- Institutionalised Paxos Consensus -- Introducing Datatypes in DL-Lite -- Convex Solutions of RCC8 Networks -- Propositional Planning as Optimization -- Large-Scale Parallel Stratified Defeasible Reasoning -- Path-Constrained Markov Decision Processes: Bridging the Gap Between Probabilistic Model-Checking and Decision-Theoretic Planning -- A Probabilistic Semantics for Abstract Argumentation -- An Empirical Study of Argumentation Schemes for Deliberative Dialogue -- An Approach to Multi-Agent Planning with Incomplete Information -- Efficient Crowdsourcing of Unknown Experts Using Multi-Armed Bandits -- Logic-Based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups -- Relation Mining in the Biomedical Domain Using Entity-Level Semantics -- ArvandHerd: Parallel Planning with a Portfolio -- Joint Assessment and Restoration of Power Systems -- Self-Assessing Agents for Explaining Language Change: A Case Study in German -- Detecting Human Patterns in Laser Range Data -- Maxi-Consistent Operators in Argumentation.
,
Multi-Unit Auctions with a Stochastic Number of Asymmetric Bidders.
Permalink