IJCAI-01 Format Instructions (2010)
The IJCAI-01 Proceedings will be printed from electronic manuscripts submitted by the authors. The electronic manuscript will also be included in a CD-ROM version of the proceedings if the manuscript...
A fixed-parameter tractable algorithm for spatio-temporal calendar management (2010)
Calendar management tools assist users with coordinating their daily life. Different tasks have to be scheduled according to the user preferences. In many cases, tasks are at different locations and...
N/A
Zur Erlangung Des Doktorgrades, Stefan Duffner, Prof Dr, Bernhard Nebel, Franck Mamalet, Sébastien Roux, ...
First of all, I would like to thank Dr. Christophe Garcia for his guidance and support over the last three years. This work would not have been possible without his excellent scientific as well as...
Semantic attachments for domain-independent planning systems (2009)
Christian Dornhege, Patrick Eyerich, Thomas Keller, Sebastian Trüg, Michael Brenner, Bernhard Nebel
Solving real-world problems using symbolic planning often requires a simplified formulation of the original problem, since certain subproblems cannot be represented at all or only in a way leading to...
A Game Controller Based on Multiple Sensors (2009)
Dapeng Zhang, Zhongjie Cai, Kefei Chen, Bernhard Nebel
A digital game is normally controlled by hand. Playing such a game requires only minimum hand movements. Rather than being easy and comfortable, this game controller is designed to be physically...
Integrating Symbolic and Geometric Planning for Mobile Manipulation (2009)
Christian Dornhege, Marc Gissler, Matthias Teschner, Bernhard Nebel
Abstract — Mobile manipulation requires to solve multiple subproblems. One is planning in high-dimensional configuration spaces, that we approach in this work. We decompose the manipulation problem...
A Fixed-Parameter Tractable Algorithm for Spatio-Temporal Calendar Management (2009)
Calendar management tools assist users with coordinating their daily life. Different tasks have to be scheduled according to the user preferences. In many cases, tasks are at different locations and...
Faster than UPPAAL? (Tool Paper) (2009)
Sebastian Kupferschmid, Martin Wehrle, Bernhard Nebel, Andreas Podelski, Albert-ludwigs-universität Freiburg
Abstract. It is probably very hard to develop a new model checker that is faster than UPPAAL for verifying (correct) timed automata. In fact, our tool MCTA does not even try to compete with UPPAAL in...
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle (2009)
Gabriele Röger, Malte Helmert, Bernhard Nebel
Integrating agent programming languages and efficient action planning is a promising approach because it combines the expressive power of languages such as Golog with the possibility of searching for...
Simulating Spatial Reasoning Using ACT-R (2009)
Jona Boeddinghaus, Marco Ragni, Markus Knauff, Bernhard Nebel
We present an ACT-R model of spatial reasoning based on the SRM model (Spatial Reasoning by Models). This model maps spatial working memory to a two-dimensional array and uses a spatial focus to...
Tobias Lauer, Betreuer Prof, Dr. Thomas Ottmann, Dekan Der Fakultät Für Angew, Te Wissenschaften, Prof Dr, ...
wobei die Visualisierungen in der Regel von den Lehrenden vorbereitet und den Lernenden präsentiert werden. Handelt es sich bei den Visualisierungen um interaktive Animationen oder Simulationen, so...
Bernhard Nebel, Alexander Scivos, Sap Ag
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property of almost all of...
RoboCupRescue- Robot League Team (2008)
Rescuerobots Freiburg (germany, Er Kleiner, Christian Dornhege, Rainer Kümmerle, Michael Ruhnke, Bastian Steder, ...
Abstract. This paper describes the approach of the RescueRobots Freiburg team, which is a team of students from the University of Freiburg that originates from the former CS Freiburg team...
Applying Automatic Planning Systems to Airport Ground-TraOEc Control _ A Feasibility Study (2008)
Abstract. Planning techniques have matured as demonstrated by the performance of automatic planning systems at recent international planning system competitions. Nowadays it seems feasible to apply...
Wolfram Burgard, Luc De Raedt, Bernhard Nebel, Lars Schmidt-thieme
• Assume, we know the whole structure of a bn except a single edge. • This edge represents a single independence statement. • Check it and include edge based on outcome of that test.
Text Generation for Strategic Computing (2008)
Marina Del Rey, William Mann, Norman Sondheimer, Bernhard Nebel, Lynn Poulton, George Vamos, ...
The US military is an information-rich, computer intensive organization. It needs to have easy, understandable access to a wide variety of information. Currently, information is often in obscure...
Joint probability distributions (2008)
Wolfram Burgard, Luc De Raedt, Bernhard Nebel, Lars Schmidt-thieme, Prob Independence, Em Algo, ...
separation in graphs,
der Fakultät für Mathematik und Physik (2008)
Der Albert-ludwigs-universität Freiburg Im Breisgau, Yijia Chen, Dekan Prof, Dr. Dr, Rolf Schneider, Zweiter Referent, ...
Er Scivos, Bernhard Nebel, Albert-ludwigs-universität Freiburg
Abstract. We develop a theory for ternary point-based calculi such that the relations are invariant when all points are mapped by rotations, scalings or translations and propose methods to determine...
COMPLEXITY REDUCTION TECHNIQUES FOR ADVANCED MEMS ACTUATORS SIMULATION (2008)
Vorgelegt Von, Albert-ludwigs-universität Freiburg, Adresse Lehrstuhl Für Simulation, Dekan Prof, Dr. Bernhard Nebel, Prof Dr, ...
To my parents Erklärung nach S5(2) der Promotionsordnung Ich erkläre hiermit, dass ich die vorliegende Arbeit ohne unzulässige Hilfe Dritter und ohne Benutzung anderer als der angegebenen...
Simulating Spatial Reasoning Using ACT-R (2008)
Jona Boeddinghaus, Marco Ragni, Markus Knauff, Bernhard Nebel
We present an ACT-R model of spatial reasoning based on the SRM model (Spatial Reasoning by Models). This model maps spatial working memory to a two-dimensional array and uses a spatial focus to...
WIP: From Multimedia to Intellimedia (2008)
Elisabeth Andre, Wolfgang Finkler, Winfried Graf, Karin Harbusch, Jochen Heinsohn, Anne Kilger, ...
This video provides an overview of the WIP project. WIP aimed at the development of a presentation system that is able to generate a variety of multimedia documents considering generation parameters,...
Attributive Description Formalisms...and the Rest of the World (2008)
Research in knowledge representation has led to the development of so-called terminological logics, the purpose of which is to support the representation of the conceptual and terminological part of...
GOLOG and PDDL: What is the Relative Expressiveness? (2008)
Patrick Eyerich, Bernhard Nebel, Gerhard Lakemeyer, Jens Claßen
Abstract. Action formalisms such as GOLOG or FLUX have been developed primarily for representing and reasoning about change in a logical framework. For this reason, expressivity was the main goal in...
08372 Executive Summary -- Computer Science in Sport - Mission and Methods (2008)
Wiemeyer, Josef, Baca, Arnold, Lames, Martin, Lyons, Keith, Nebel, Bernhard
From September 7 to 10, 2008 about 30 experts from computer science and sport science (see Appendix B) met at the Leibniz-Zentrum für Informatik in Dagstuhl to discuss interdisciplinary issues in...
08372 Abstracts Collection -- Computer Science in Sport - Mission and Methods (2008)
Baca, Arnold, Lames, Martin, Lyons, Keith, Nebel, Bernhard, Wiemeyer, Josef
From 07.09. to 10.09., the Dagstuhl Seminar 08372 ``Computer Science in Sport - Mission and Methods'' was held in Schloss Dagstuhl - Leibniz Center for Informatics. During the seminar, several...
The notion of "expressive power" is often used in the literature on planning. However, it is usually only used in an informal way. In this paper, we will formalize this notion using the...
Published In, Sonia Bergamaschi, Bernhard Nebel
We present an intelligent tool for the acquisition of object oriented schemata supporting multiple inheritance, which preserves taxonomy coherence and performs taxonomic inferences. Its theoretical...
Thilo Weigel, Jens-steffen Gutmann, Bernhard Nebel, Klaus Muller, Markus Dietl
The success of CS Freiburg at RoboCup 2000 can be attributed to an effective cooperation between players based on sophisticated soccer skills and a robust and accurate self-localization method. In...
What Makes The Difference Between HSP and FF? J org Hoffmann (2007)
The HSP and FF systems are state-of-the-art domain independent planners. FF can historically be seen as a successor of HSP. It is based on the same ideas like HSP, but differs from its predecessor in...
1 Logics for Knowledge Representation (2007)
Knowledge representation and reasoning plays a central role in Artificial Intelligence. Research in Artificial Intelligence (henceforth AI) started off by trying to identify the general mechanisms...
Thilo Weigel, Alexander Kleiner, Florian Diesch, Markus Dietl, Bernhard Nebel, Patrick Stiegeler, ...
1 and Boris Szerbakowski 3 1 Institut fur Informatik 2
While there seems to be a general consensus about the expressive power of a number of language features in planning formalisms, one can nd many dierent statements about the expressive power of...
Towards Thorough Empirical Methods for AI Planning J org Hoffmann (2007)
Empirical investigations in the area of AI planning have been focused on a comparatively small set of benchmark tasks. Trying to design larger scale experiments for wellfounded empirical reasoning in...
In Defense of PDDL Axioms (2007)
Sylvie Thiébaux, Jörg Hoffmann, J Org Hoffmann, Bernhard Nebel
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the...
In Defense of PDDL Axioms (2007)
Sylvie Thiébaux, Jörg Hoffmann, J Org Hoffmann, Bernhard Nebel
There is controversy as to whether explicit support for PDDL- like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the...
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning (2007)
Bernhard Nebel, Alexander Scivos
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property of almost all of...
Ec Information Society Technologies Programme (2007)
Cognitive Systems Integrated, Coordinator Henrik, I. Christensen, Partners Jeremy Wyatt, Aaron Sloman, Hans Uszkoreit, ...
Objective of project 1 2.1 The problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Theory objectives: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
Qualitative Spatial Representation and Reasoning: A Hierarchical Approach (2007)
The ability to reason in space is crucial for agents in order to make informed decisions. Current high-level qualitative approaches to spatial reasoning have serious deficiencies in not reflecting...
Towards an integration of Golog and planning (2007)
Jens Claßen, Patrick Eyerich, Gerhard Lakemeyer, Bernhard Nebel
The action language Golog has been applied successfully to the control of robots, among other things. Perhaps its greatest advantage is that a user can write programs which constrain the search for...
Submitted on: First referee: Second referee: Supervisor: (2007)
Prof Dr, Wolfram Burgard, Hauke Malte Strasdat, Albert-ludwigs Universität Freiburg, Prof Dr, Wolfram Burgard, ...
In various robotics applications such as delivery tasks or exploration, autonomous robots are required to orientate themselves in their environment. In this thesis, we present a framework for...
Towards an integration of Golog and planning (2007)
Jens Claßen, Patrick Eyerich, Gerhard Lakemeyer, Bernhard Nebel
The action language Golog has been applied successfully to the control of robots, among other things. Perhaps its greatest advantage is that a user can write programs which constrain the search for...
Qualitative Spatial Representation and Reasoning: A Hierarchical Approach (2007)
The ability to reason in space is crucial for agents in order to make informed decisions. Current high-level qualitative approaches to spatial reasoning have serious deficiencies in not reflecting...
Qualitative Spatial Representation and Reasoning: A Hierarchical Approach (2007)
The ability to reason in space is crucial for agents in order to make informed decisions. Current high-level qualitative approaches to spatial reasoning have serious deficiencies in not reflecting...
05491 Abstracts Collection -- Spatial Cognition: Specialization and Integration (2007)
Cohn, Anthony G., Freksa, Christian, Nebel, Bernhard
From 04.12.05 to 09.12.05, the Dagstuhl Seminar 05491 ``Spatial Cognition: Specialization and Integration'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl....
Qualitative Spatial Representation and Reasoning: A Hierarchical Approach (2007)
The ability to reason in space is crucial for agents in order to make informed decisions. Current high-level qualitative approaches to spatial reasoning have serious deficiencies in not reflecting...
Qualitative Spatial Representation and Reasoning: A Hierarchical Approach (2007)
The ability to reason in space is crucial for agents in order to make informed decisions. Current high-level qualitative approaches to spatial reasoning have serious deficiencies in not reflecting...
Datum der Promotion: 4.12.2006 (2006)
Dissertation Zur Erlangung Des Doktorgrades, Dipl. -math Sven Siebert, Dekan Prof, Dr. Bernhard Nebel, Referenten Prof, Dr. Rolf Backofen, ...
Die Sekundärstruktur einer RNA ist definiert als eine Menge von Basenpaaren,
RFID Technology-based Exploration and SLAM for Search and Rescue (2006)
Alexander Kleiner, Er Kleiner, Johann Prediger, Bernhard Nebel
Robot search and rescue is a time critical task, i.e. a large terrain has to be explored by multiple robots within a short amount of time. The efficiency of exploration depends mainly on the...
RoboCupRescue - Robot League Team (2006)
Rescuerobots Freiburg Germany, Er Kleiner, Christian Dornhege, Rainer Kümmerle, Michael Ruhnke, Bastian Steder, ...
This paper describes the approach of the RescueRobots Freiburg team, which is a team of students from the University of Freiburg that originates from the former CS Freiburg team (RoboCupSoccer) and...
Peter Auer, Aude Billard, Horst Bischof, Isabelle Bloch, Pia Boettcher, Heinrich Bülthoff, ...
Preface iii Revision History iv Acknowledgements v
Successful Search and Rescue in (2005)
Simulated Disaster Areas, Alexander Kleiner, Michael Brenner, Tobias Bräuer, Christian Dornhege, Moritz Göbelbecker, ...
RoboCupRescue Simulation is a large-scale multi-agent simulation of urban disasters where, in order to save lives and minimize damage, rescue teams must effectively cooperate despite sensing and...
A Computational Model for Spatial Reasoning with Mental Models (2005)
Marco Ragni, Markus Knauff, Bernhard Nebel
We propose a computational model for spatial reasoning by means of mental models. Our SRM model (Spatial Reasoning by Models) maps spatial working memory to a twodimensional array and uses a spatial...
Successful search and rescue in simulated disaster areas (2005)
Alexander Kleiner, Michael Brenner, Tobias Bräuer, Christian Dornhege, Moritz Göbelbecker, Mathias Luber, ...
Abstract. RoboCupRescue Simulation is a large-scale multi-agent simulation of urban disasters where, in order to save lives and minimize damage, rescue teams must effectively cooperate despite...
An Automata-Based Approach. (2005)
An Automata-based Approach, Jochen Eisinger, Betreuer Prof, Dr. Bernd Becker, Jochen Eisinger, Universität Freiburg, ...
der aufgeführten Hilfsmittel erstellt wurde.
Preface Revision History Acknowledgements (2005)
Peter Auer, Aude Billard, Horst Bischof, Isabelle Bloch, Pia Boettcher, Heinrich Bülthoff, ...
website: www.ecvision.org
Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems (2004)
Becker,Bernd, Behle,Markus, Eisenbrand,Friedrich, Fränzle,Martin, Herbstritt,Marc, Herde,Christian, ...
Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems (2004)
Becker, Bernd, Behle, Markus, Eisenbrand, Friedrich, Fränzle, Martin, Herbstritt, Marc, Herde, Christian, ...
Applying Automatic Planning Systems to Airport Ground Traffic Control - A Feasibility Study (2004)
Trueg, Sebastian, Hoffmann, Jörg, Nebel, Bernhard, Biundo, Susanne, Frühwirth, Thom, Palm, Günther
Bounded model checking and inductive verification of hybrid discrete-continuous systems (2004)
Bernd Becker, Markus Behle, Fritz Eisenbr, Martin Fränzle, Marc Herbstritt, Christian Herde, ...
We present a concept to significantly advance the state of the art for bounded model checking (BMC) and inductive verification (IV) of hybrid discrete-continuous systems. Our approach combines the...
Qualitative Reasoning Feeding Back into Quantitative Model-Based Tracking (2004)
Christian Köhler, Artur Ottlik, Hans-Hellmut Nagel, Bernhard Nebel
Tracking vehicles in image sequences of innercity road traffic scenes still constitutes a challenging task. Even if a-priori knowledge about the 3D shape of vehicles, of background structure and...
Qualitative Reasoning Feeding Back into Quantitative Model-Based Tracking (2004)
Christian Köhler, Artur Ottlik, Hans-Hellmut Nagel, Bernhard Nebel
Tracking vehicles in image sequences of innercity road traffic scenes must be considered still to constitute a challenging task. Even if a-priori knowledge about the 3D shape of vehicles, of the...
Applying Automatic Planning Systems to Airport Ground Traffic Control -- A Feasibility Study (2004)
Trueg, Sebastian, Hoffmann, Jörg, Nebel, Bernhard, Biundo, Susanne, Frühwirth, Thom, Palm, Günther
Case Based Game Play in the RoboCup Four-Legged League Part I The Theoretical Model (2003)
Alankar Karol, Bernhard Nebel, Christopher Stanton, Mary-Anne Williams
Robot Soccer involves planning at many levels, and in this paper we develop high level planning strategies for robots playing in the RoboCup FourLegged League using case based reasoning. We develop a...
In defense of PDDL axioms (2003)
Sylvie Thiébaux, Jörg Hoffmann, Bernhard Nebel
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the...
In Defense of PDDL Axioms (2003)
Sylvie Thiébaux, Jörg Hoffmann, Bernhard Nebel
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the...
Bernhard Nebel, Albert-ludwigs-universität Freiburg
Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. One way to...
Cs freiburg: coordinating robots for successful soccer playing (2002)
Thilo Weigel, Jens-steffen Gutmann, Markus Dietl, Er Kleiner, Bernhard Nebel
Abstract---Robotic soccer is a challenging research domain because many different research areas have to be addressed in order to create a successful team of robot players. This paper presents the CS...
Towards a Life-Long Learning Soccer Agent (2002)
Er Kleiner, Markus Dietl, Bernhard Nebel
Abstract. One problem in robotic soccer (and in robotics in general) is to adapt skills and the overall behavior to a changing environment and to hardware improvements. We applied hierarchical...
KiRo – An Autonomous Table Soccer Player (2002)
Abstract. This paper presents KiRo-- a system capable of playing table soccer on a competitive level and in a fully autonomous way. It can serve a human both as a teammate and an opponent but also...
On the Computational Complexity of Assumption-based Argumentation for Default Reasoning (2002)
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
Bondarenko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, the framework...
Cs freiburg: coordinating robots for successful soccer playing (2002)
Thilo Weigel, Jens-steffen Gutmann, Markus Dietl, Er Kleiner, Bernhard Nebel
Abstract—Robotic soccer is a challenging research domain because many different research areas have to be addressed in order to create a successful team of robot players. This paper presents the CS...
Alfonso Gerevini, Bernhard Nebel
There exist a number of qualitative constraint calculi that are used to represent and reason about temporal or spatial configurations. However, there are only very few approaches aiming to create a...
Dynamic Decentralized Area Partitioning for Cooperating Cleaning Robots (2002)
If multiple cleaning robots are used to cooperatively clean a larger room, e.g. an airport, the room must be partitioned among the robots. This paper describes a dynamic and decentralized method to...
Towards a Life-Long Learning Soccer Agent (2002)
Er Kleiner, Markus Dietl, Bernhard Nebel, Universität Freiburg
Abstract. One problem in robotic soccer (and in robotics in general) is to adapt skills and the overall behavior to a changing environment and to hardware improvements. We applied hierarchical...
Cs freiburg: coordinating robots for successful soccer playing (2002)
Thilo Weigel, Jens-steffen Gutmann, Markus Dietl, Er Kleiner, Bernhard Nebel
Abstract—Robotic soccer is a challenging research domain because many different research areas have to be addressed in order to create a successful team of robot players. This paper presents the CS...
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no results about algorithmic...
The operational traffic control problem: Computational complexity and solutions (2001)
Wolfgang Hatzack, Bernhard Nebel
Abstract. The operational traffic control problem comes up in a number of different contexts. It involves the coordinated movement of a set of vehicles and has by and large the flavor of a scheduling...
Cooperative sensing in dynamic environments (2001)
Markus Dietl, Jens-steffen Gutmann, Bernhard Nebel
This work presents methods for tracking objects from noisy and unreliable data taken by a team of robots. We develop a multi-object tracking algorithm based on Kalman filtering and a single-object...
This paper describes a method for coordinating the independently planned trajectories of multiple mobile robots to avoid collisions and deadlocks among them. Whenever the distance between two robots...
CS Freiburg: Global view by cooperative sensing (2001)
Markus Dietl, Jens-steffen Gutmann, Bernhard Nebel
Abstract. Global vision systems as found in the small size league are prohibited in the middle size league. This paper presents methods for creating a global view of the world by cooperative sensing...
The FF planning system: Fast plan generation through heuristic search (2001)
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal...
The FF planning system: Fast plan generation through heuristic search (2001)
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal...
RIFO revisited: Detecting relaxed irrelevance (2001)
RIFO, as has been proposed by Nebel et al. [12], is a method that can automatically detect irrelevant information in planning tasks. The idea is to remove such irrelevant information as a preprocess...
RIFO revisited: Detecting relaxed irrelevance (2001)
Abstract. RIFO, as has been proposed by Nebel et al. [13], is a method that can automatically detect irrelevant information in planning tasks. The idea is to remove such irrelevant information as a...
CS Freiburg: Doing the right thing in a group (2001)
Thilo Weigel, Willi Auerbach, Markus Dietl, Burkhard Dumler, Kornel Marko, Klaus Muller, ...
3 and Maximilian Thiel 1 1
Cooperating Physical Robots: (2001)
Lesson In Playing, Bernhard Nebel
Having a robot that carries out a task for you is certainly of some help. Having a group of robots seems to be even better because in this case the task may be finished faster and more reliably....
Thilo Weigel, Er Kleiner, Florian Diesch, Markus Dietl, Bernhard Nebel, Patrick Stiegeler, ...
Abstract. The CS Freiburg team has become F2000 champion the third time in the history of RoboCup. The success of our team can probably be attributed to its robust sensor interpretation and its team...
RIFO Revisited: Detecting Relaxed Irrelevance (2001)
Jorg Hoffmann And, Jorg Hoffmann, Bernhard Nebel
RIFO, as has been proposed by Nebel et al. [8], is a method that can automatically detect irrelevant information in planning tasks. The idea is to remove such irrelevant information as a pre-process...
The FF Planning System: Fast Plan Generation Through Heuristic Search (2000)
We describe and evaluate the algorithmic techniques that are used in the ff planning system. Like the well known HSP system, ff relies on forward state space search, using a heuristic that estimates...
On the Compilability and Expressive Power of Propositional Planning Formalisms (2000)
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize...
Finding Admissible and Preferred Arguments Can be Very Hard (2000)
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming only, to a number of...
Jens-steffen Gutmann, Thilo Weigel, Bernhard Nebel
Self-localization is important in almost all robotic tasks. For playing an aesthetic and effective game of robotic soccer, self-localization is a necessary prerequisite. When we designed our robotic...
On the Compilability and Expressive Power of Propositional Planning Formalisms (2000)
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize...
Fast, Accurate, and Robust Self-Localization in the RoboCup Environment (2000)
Jens-steffen Gutmann, Thilo Weigel, Bernhard Nebel
Self-localization is important in almost all robotic tasks. For playing an aesthetic and effective game of robotic soccer, self-localization is a necessary prerequisite. When we designed our robotic...
What is the Expressive Power of Disjunctive Preconditions? (2000)
. While there seems to be a general consensus about the expressive power of a number of language features in planning formalisms, one can nd many dierent statements about the expressive power of...
The CS Freiburg '99 team (2000)
Bernhard Nebel, Jens-steffen Gutmann, Wolfgang Hatzack
Abstract. Based on the design of the CS Freiburg team, which participated sucessfully in Robocup’98, we developed a new team of robotic soccer players. While the hardware components and software...
What is the expressive power of disjunctive preconditions (1999)
Abstract. While there seems to be a general consensus about the expressive power of a number of language features in planning formalisms, one can nd many dierent statements about the expressive power...
Fast, Accurate, and Robust Self-Localization in the RoboCup Environment (1999)
Jens-steffen Gutmann, Thilo Weigel, Bernhard Nebel
. Self-localization is important in almost all robotic tasks. For playing an aesthetic and effective game of robotic soccer, self-localization is a necessary prerequisite. When we designed our...
The CS Freiburg Team: Playing Robotic Soccer Based on an Explicit World Model (1999)
Jens-steffen Gutmann, Wolfgang Hatzack, Immanuel Herrmann, Bernhard Nebel, Frank Rittinger, Augustinus Topor, ...
Robotic soccer is an ideal task to demonstrate new techniques and to explore new problems. Moreover, problems and solutions can be easily communicated because soccer is a well-known game. Our...
Preferred Arguments are Harder to Compute than Stable Extensions (1999)
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
Based on an abstract framework for nonmonotonic reasoning, Bondarenko et al. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such...
Fast, Accurate, and Robust Self-Localization in Polygonal Environments (1999)
Jens-steffen Gutmann, Thilo Weigel, Bernhard Nebel
Self-localization is important in almost all robotic tasks. For playing an aesthetic and effective game of robotic soccer, self-localization is a necessary prerequisite. When we designed our robotic...
. The recent approaches of extending the graphplan algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We...
Participation at RoboCup'98: The World Champions in Robotic Soccer (1999)
Bernhard Nebel, Wolfgang Hatzack, Thilo Weigel, Jens-steffen Gutmann, Immanuel Herrmann, Frank Rittinger, ...
Robotic soccer is a challenging research domain that can be used to explore new problems and to demonstrate new techniques. We participated in RoboCup'98 in order to explore the problems of...
Jens-Steffen Gutmann, J. -s. Gutmann, Immanuel Herrmann, Bernhard Nebel, Wolfgang Hatzack, Augustinus Topor, ...
Robotic soccer is a challenging research domain because problems in robotics, artificial intelligence, multi-agent systems and real-time reasoning have to be solved in order to create a successful...
Preferred Arguments are Harder to Compute than Stable Extensions (1999)
Yannis Dimopoulos, Bernhard Nebel, Francesco Toni
Based on an abstract framework for nonmonotonic reasoning, Bondarenko et al. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such...
Efficient methods for qualitative spatial reasoning (1998)
The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the...
Efficient methods for qualitative spatial reasoning (1998)
The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the...
On the Compilability and Expressive Power of Propositional Planning Formalisms (1998)
The recent approaches of extending the graphplan algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize...
Jens-Steffen Gutmann, J-s. Gutmann, Immanuel Herrmann, Bernhard Nebel, Wolfgang Hatzack, Augustinus Topor, ...
. This paper describes the CS Freiburg Team for the RoboCup '98 contest. Our main focus lies in developing reliable and robust perception technology and basic behaviors for playing soccer with...
The CS Freiburg '99 Team (1998)
Bernhard Nebel, Jens-Steffen Gutmann, B. Nebel, J. -s. Gutmann, Wolfgang Hatzack
Introduction One of the interesting challenges in designing a successful robotic soccer team is the need to cover the entire loop from sensing over deliberation to acting. For example, successful...
Efficient Methods for Qualitative Spatial Reasoning (1998)
. The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that...
Jens-steffen Gutmann, Wolfgang Hatzack, Immanuel Herrmann, Bernhard Nebel, Frank Rittinger, Augustinus Topor, ...
. Robotic soccer is a challenging research domain because problems in robotics, artificial intelligence, multi-agent systems and real-time reasoning have to be solved in order to create a successful...
Efficient Methods for Qualitative Spatial Reasoning (1998)
. The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that...
Spatial Reasoning with Topological Information (1998)
. This chapter summarizes our ongoing research on topological spatial reasoning using the Region Connection Calculus. We are addressing different questions and problems that arise when using this...
On the compilability and expressive power of propositional planning formalisms (1998)
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of “expressive power ” is. We formalize the...
Spatial reasoning with topological information (1998)
www.informatik.uni-freiburg.de/~sppraum Abstract. This chapter summarizes our ongoing research on topological spatial reasoning using the Region Connection Calculus. We are addressing di erent...
Extending planning graphs to an ADL subset (1997)
Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos
We describe an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators in such away that almost all interesting properties of the original...
Ignoring irrelevant facts and operators in plan generation (1997)
Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan system, however,...
The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not...
While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical efficiency of...
Ignoring Irrelevant Facts and Operators in Plan Generation (1997)
Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
. It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan system, however,...
The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not...
Extending Planning Graphs to an ADL Subset (1997)
Jana Koehler, Bernhard Nebel, Joerg Hoffmann, Yannis Dimopoulos
We describe an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators. The data structure of planning graphs is extended to cope with the...
Extending Planning Graphs to an ADL Subset (1997)
Jana Koehler, Bernhard Nebel, Joerg Hoffmann, Yannis Dimopoulos
. We describe an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators in such a way that almost all interesting properties of the original...
Encoding Planning Problems in Nonmonotonic Logic Programs (1997)
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
. We present a framework for encoding planning problems in logic programs with negation as failure, having computational efficiency as our major consideration. In order to accomplish our goal, we...
. While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical efficiency of...
The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not...
. While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical efficiency of...
Extending Planning Graphs to an ADL Subset (1997)
Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos
This paper describes an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators. The data structure of planning graphs is extended to cope...
On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of RCC-8 (1997)
The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not...
Editor: Abstract. While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical e...
How Hard is it to Revise a Belief Base? (1996)
Bernhard Nebel, Albert-ludwigs-universiat Freiburg
If a new piece of information contradicts our previously held beliefs, we have to revise our beliefs. This problem of belief revision arises in a number of areas in Computer Science and Artificial...
Proceedings of ECAI-96 Workshop: Empirical AI (1996)
Toby Walsh (ed.), Toby Walsh (editor, Paul Cohen, Ian Gent, David Mcallester, Steve Muggleton, ...
inference patterns reversed-engineered from previously successful expert systems are not a productivity tool [2]. These isolated MIP experiments must be explored. If they prove to be a general...
Complexity results for SAS + planning (1995)
Christer Backstrom, Bernhard Nebel
We have previously reported a number of tractable planning problems defined in the SAS formalism. This report complements these results by providing a complete map over the complexity of SAS planning...
Complexity results for SAS + planning (1995)
Christer Backstrom, Bernhard Nebel
We have previously reported a number of tractable planning problems defined in the SAS formalism. This report complements these results by providing a complete map over the complexity of SAS planning...
International Workshop on Description Logics (1995)
Alex Borgida, Maurizio Lenzerini, Daniele Nardi, Bernhard Nebel
A formal language for representing and reasoning about time, actions and plans in a uniform way is presented. We employ an action representation in the style of Allen, where an action is represented...
Complexity Results for SAS+ Planning (1995)
Christer Bäckström, Bernhard Nebel
We have previously reported a number of tractable planning problems defined in the SAS + formalism. This report complements these results by providing a complete map over the complexity of SAS +...
Plan Reuse versus Plan Generation: A Theoretical and Empirical Analysis (1995)
The ability of a planner to reuse parts of old plans is hypothesized to be a valuable tool for improving efficiency of planning by avoiding the repetition of the same planning effort. We test this...
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra (1995)
Bernhard Nebel, Hans-Jürgen Bürckert
We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the...
Complexity Results for SAS+ Planning (1995)
Christer Bäckström, Christer B Ackstr Om, Bernhard Nebel
This article complements these results by providing a complete map over the complexity of SAS
Computational Properties of Qualitative Spatial Reasoning: First Results (1995)
Bernhard Nebel, Abt Kunstliche Intelligenz, D- Ulm
. While the computational properties of qualitative temporal reasoning have been analyzed quite thoroughly, the computational properties of qualitative spatial reasoning are not very well...
Complexity Results for SAS+ Planning (1995)
Christer Bäckström, Bernhard Nebel
We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This paper complements these results by providing a complete map over the complexity of SAS+...
Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-jurgen Pro Tlich, Enrico Franconi
We consider dierent methods of optimizing the classication process of terminological representation systems, and evaluate their eect on three dierent types of test data. Though these techniques can...
An Empirical Analysis of Terminological Representation Systems (1994)
Jochen Heinsohn, Daniel Kudenko, Bernhard Nebel, Hans-Jürgen Profitlich
The family of terminological representation systems has its roots in the representation system kl-one. Since the development of kl-one more than a dozen similar representation systems have been...
Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, Enrico Franconi
We consider different methods of optimizing the classification process of terminological representation systems, and evaluate their effect on three different types of test data. Though these...
Base Revision Operations and Schemes: Semantics, Representation, and Complexity (1994)
. The theory of belief revision developed by Gardenfors and his colleagues characterizes the classes of reasonable belief revision operations. However, some of the assumptions made in the theory of...
Sonia Bergamaschi, Bernhard Nebel
We present an intelligent tool for the acquisition of object oriented schemata supporting multiple inheritance, which preserves taxonomy coherence and performs taxonomic inferences. Its theoretical...
On the Computational Complexity of Temporal Projection, Planning, and Plan Validation (1994)
Bernhard Nebel, Christer Bäckström
One kind of temporal reasoning is temporal projection---the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as plan...
Artificial Intelligence: A Computational Perspective (1994)
Although the computational perspective on cognitive tasks has always played a major role in Artificial Intelligence, the interest in the precise determination of the computational costs that are...
On the Computational Complexity of Temporal Projection and Plan Validation (1994)
Proc Tenth, Bernhard Nebel, Christer Backstrom
One kind of temporal reasoning is temporal projection---the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as story...
Foundations of Knowledge Representation and Reasoning (1994)
Gerhard Lakemeyer, Bernhard Nebel
this paper is not by itself a paper on computational complexity analysis of commonsense reasoning, it makes use of computational complexity results [ Gottlob, 1992 ] that show that the three main...
On the Computational Complexity of Temporal Projection, Planning, and Plan Validation (1994)
Bernhard Nebel, Christer Bäckström
One kind of temporal reasoning is temporal projection---the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as plan...
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra (1994)
Bernhard Nebel, Hans-Jürgen Bürckert
We introduce a new subclass of Allen's interval algebra we call "ORD-Horn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the...
Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt, Gert Smolka
Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional...
Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective (1993)
August Bernhard, Bernhard Nebel, Jana Koehler
The ability of a planner to modify a plan is considered as a valuable tool for improving efficiency of planning by avoiding the repetition of the same planning effort. From a computational complexity...
Combining Classification and Nonmonotonic Inheritance Reasoning: A First Step (1993)
The formal analysis of semantic networks and frame systems led to the development of nonmonotonic inheritance networks and terminological logics. While nonmonotonic inheritance networks formalize the...
Complexity Results for SAS+ Planning (1993)
Christer Bäckström, Bernhard Nebel
We have previously reported a number of tractable planning problems defined in the SAS + formalism. This paper complements these results by providing a complete map over the complexity of SAS +...
Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt, Gert Smolka
. Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional...
Terminological Knowledge Representation: A Proposal for a Terminological Logic (1992)
Franz Baader, Hans-Jürgen Bürckert, Jochen Heinsohn, Bernhard Hollunder, Jürgen Müller, Bernhard Nebel, ...
This paper contains a proposal for a terminological logic. The formalisms for representing knowledge as well as the needed inferences are described. 1 Introduction An important aspect of intelligence...
An Empirical Analysis of Terminological Representation Systems (1992)
Published In Artificial, Jochen Heinsohn, Daniel Kudenko, Bernhard Nebel, Hans-jurgen Profitlich
The family of terminological representation systems has its roots in the representation system kl-one. Since the development of kl-one more than a dozen similar representation systems have been...
Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective (1992)
The ability of a planner to modify a plan is considered as a valuable tool for improving efficiency of planning by avoiding the repetition of the same planning effort. From a computational complexity...
Syntax-Based Approaches to Belief Revision (1992)
this paper, we adopt the former perspective. In order to distinguish operations on syntactic descriptions -- on belief bases -- from operations on belief sets, belief base changes are called base...
Foundational Belief Change (1992)
Abhaya C. Nayak, John Bennett, Rolf Eberle, Peter Gardenfors, Ove Hansson, Henry E. Kyburg, ...
: This paper is concerned with the construction of a base contraction (revision) operation such that the theory contraction (revision) operation generated by it will be fully AGM-rational. It is...
Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, Enrico Franconi
We consider different methods of optimizing the classification process of terminological representation systems, and evaluate their effect on three different types of test data. Though these...
On the Computational Complexity of Planning and Story Understanding (1992)
Vienna Austria, Christer Backstrom, Bernhard Nebel
. Other authors have shown that temporal projection---the computation of the consequences for a set of events---is intractable even for severly restricted cases. They have also suggested that...
On the Computational Complexity of Temporal Projection and Plan Validation (1992)
Bernhard Nebel, Christer Bäckström
One kind of temporal reasoning is temporal projection---the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as story...
An Empirical Analysis of Terminological Representation Systems (1992)
Jochen Heinsohn, Daniel Kudenko, Bernhard Nebel, Hans-Jürgen Profitlich
The family of terminological representation systems has its roots in the representation system klone. Since the development of this system more than a dozen similar representation systems have been...
On the Computational Complexity of Planning and Story Understanding (1992)
Christer Bäckström, Bernhard Nebel
. Other authors have shown that temporal projection---the computation of the consequences for a set of events---is intractable even for severly restricted cases. They have also suggested that...
Terminological Reasoning and Information Management (1991)
Bernhard Nebel, Deutsches Forschungszentrum, Fur Kunstliche Intelligenz, Christof Peltason
Reasoning with terminological logics is a subfield in the area of knowledge representation that evolved from the representation language kl-one. Its main purpose is to automatically determine the...
Terminological Cycles: Semantics and Computational Properties (1991)
Published John, F. Sowa, P. Morgan, Bernhard Nebel
Terminological knowledge representation formalisms are intended to capture the analytic relationships between terms of a vocabulary intended to describe a domain. A term whose definition refers,...
Belief Revision and Default Reasoning: Syntax-Based Approaches (1991)
Belief revision leads to temporal nonmonotonicity, i.e., the set of beliefs does not grow monotonically with time. Default reasoning leads to logical nonmonotonicity, i.e., the set of consequences...
Attributive Description Formalisms (1991)
Research in knowledge representation has led to the development of socalled terminological logics, the purpose of which is to support the representation of the conceptual and terminological part of...
Terminological Reasoning is Inherently Intractable (1990)
Computational tractability has been a major concern in the area of terminological knowledge representation and reasoning. However, all analyses of the computational complexity of terminological...
Representation and reasoning with attributive descriptions (1990)
Bernhard Nebel, Gert Smolka, Ibm Deutschl
This paper surveys terminological representation languages and feature-based unification gram-mars pointing out the similarities and differences between these two families of attributive description...
Reasoning and Revision in Hybrid Representation Systems (1990)
This reprint version is almost identical to the book. The page numbering is different, the format of the bibliography differs from the book and the reprint version does not contain an author index....
A Knowledge Level Analysis of Belief Revision (1989)
Revising beliefs is a task any intelligent agent has to perform. For this reason, belief revision has received much interest in Artificial Intelligence. However, there are serious problems when...
What is Hybrid in Hybrid Representation and Reasoning Systems? (1989)
Hybrid knowledge representation and reasoning systems have received a lot of interest in recent years. In this paper, we will give a brief survey of the principles and ideas behind these systems and...
Reasoning and revision in hybrid representation systems. (1989)
Saarbrücken, Univ., Diss., 1989.
Computational Complexity of Terminological Reasoning in BACK (1988)
Terminological reasoning is a mode of reasoning all hybrid knowledge representation systems based on KL-ONE rely on. After a short introduction of what terminological reasoning amounts to, it is...
Hybrid Reasoning in BACK (1988)
Bernhard Nebel, Kai Von Luck, Ibm Deutschland Gmbh
Hybrid knowledge representation formalisms consist of two or more different subformalisms for representing different kinds of knowledge or knowledge in different kinds of representation formats. For...
Issues of Integration and Balancing in Hybrid Knowledge Representation Systems (1987)
Bernhard Nebel, Kai Von Luck, Technische Universtat Berlin
In the last several years the hybrid approach to Knowledge Representation has received much attention, because it was felt that one monolithic knowledge representation formalism cannot meet all...
A Logical-Form and Knowledge-Base Design for Natural Language Generation (1986)
Norman K. Sondheimer, Bernhard Nebel
This paper presents a technique for interpreting output demands by a natural language sentence generator in a formally transparent and efficient way. These demands are stated in a logical language. A...
Thomas Christaller, Heinz Marburger, Katharina Morik, Bernhard Nebel, Wolfgang Wahlster
For natural language dialog systems, going beyond domain independence means the attempt to create a core system that can serve as a basis for interfaces to various application classes that differ not...
Thomas Christaller, Heinz Marburger, Katharina Morik, Bernhard Nebel, Wolfgang Wahlster
For natural language dialog systems, going beyond domain independence means the attempt to create a core system that can serve as a basis for interfaces to various application classes that differ not...
In : Kühn-Archiv. Bd 12.
Halle, Naturwiss. Diss. v. 30. Sept. 1926.
A Modal Computational Framework for Default Reasoning
Artosi, Alberto, Cattabriga, Paola, Governatori, Guido, Brewka, Gerhard, Habel, Christopher, Nebel, Bernhard
Usually a default rule A : B/C is intended to mean that if A holds in a state of affairs a B is consistent, then C follows by default. However, C is not a necessary conclusion: different states of...
Finding Admissible and Preferred Arguments Can be Very Hard
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming only, to a number of...