Titlebook: KI-99: Advances in Artificial Intelligence; 23rd Annual German C Wolfram Burgard,Armin B. Cremers,Thomas Cristaller Conference proceedings

COKE

ARIA

Conference proceedings 1999 much to the vision of the so-called Information Society. As early as the 1980s, some of us imagined distributed knowledge bases containing the explicable knowledge of a company or any other organization. Today, such systems are becoming reality. In the process, other technologies have had to be dev

BLOT

From AI to Systemic Knowledge Managementus 1988) ignored the linguistic turn” in the hermeneutic sciences, and it has completely ignored the ongoing cognitivistic turnïn the sciences that are mostly interested in putting to use the vastly exaggerated promises of AI: management sciences, innovation management, business consulting, and knowledge management (see Ryan 1991).

责任

Anal-Canal

Chagrin

A Theory of First-Order Counterfactual Reasoning Ramification Problem in the Fluent Calculus, where indirect effects of actions are accounted for via causal propagation, allows to deduce the immediate consequences of a counterfactual condition. We show that our theory generalizes Pearl etal.’s characterization, based on causal models, of propositional counterfactuals.

间接

Logic—Based Choice of Projective Termstes for lexical choice, we outline the semantic and pragmatic conditions for their use.We present an abductive proof method that allows us to collect these conditions. Sets of collected conditions can be mapped unambiguously to corresponding projective items.

Barrister

Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalismsin a particular formalism by introducing the notion of “compilation schemes” between planning formalisms. Using this notion, we analyze the expressive power of a large family of propositional planning formalisms and show, e.g., that Gazen and Knoblock’s approach to compiling conditional effects away is optimal.

Confirm

恃强凌弱

KI-99: Advances in Artificial Intelligence978-3-540-48238-3Series ISSN 0302-9743 Series E-ISSN 1611-3349