Kaiserslautern - Fachbereich Informatik
Refine
Year of publication
Document Type
- Preprint (346) (remove)
Has Fulltext
- yes (346)
Keywords
- AG-RESY (17)
- Case-Based Reasoning (16)
- RODEO (10)
- Fallbasiertes Schliessen (9)
- Case Based Reasoning (6)
- Abstraction (5)
- Fallbasiertes Schließen (5)
- Robotics (5)
- case-based problem solving (5)
- CoMo-Kit (4)
- Force-Torque (4)
- Knowledge Acquisition (4)
- case-based reasoning (4)
- Assembly (3)
- COMOKIT (3)
- HANDFLEX (3)
- Internet (3)
- Knowledge acquisition (3)
- Manipulation skills (3)
- Maschinelles Lernen (3)
- deformable objects (3)
- distributed software development (3)
- distributed software development process (3)
- explanation-based learning (3)
- problem solving (3)
- resolution (3)
- vibration (3)
- CAPlan (2)
- CIM-OSA (2)
- Deduction (2)
- Deformable Objects (2)
- Diagnose technischer Systeme (2)
- Distributed Software Development (2)
- Expertensysteme (2)
- HOT (2)
- MOLTKE-Projekt (2)
- Manipulation (2)
- Navigation (2)
- PATDEX (2)
- Prozesssteuerung (2)
- RONAF (2)
- Robotik (2)
- SDL (2)
- Software Agents (2)
- TOVE (2)
- Term rewriting systems (2)
- Wissensakquisition (2)
- application (2)
- artificial neural networks (2)
- building automation (2)
- case based reasoning (2)
- case-based planning (2)
- combined systems with sha (2)
- computer aided planning (2)
- confluence (2)
- design patterns (2)
- disjoint union (2)
- fallbasiertes Schliessen (2)
- formal specification (2)
- genetic algorithms (2)
- innermost termination (2)
- learning system (2)
- mobile robots (2)
- modularity (2)
- requirements engineering (2)
- reuse (2)
- self-organization (2)
- temporal logic (2)
- termination (2)
- theorem prover (2)
- trajectory planning (2)
- weak termination (2)
- Accounting (1)
- Agents (1)
- Automated Reasoning (1)
- Automated theorem proving (1)
- Automatic Theorem Provi (1)
- Automation (1)
- Autonomous mobile robots (1)
- Bitlisten (1)
- Blackboard architecture (1)
- CAP (1)
- CAS (1)
- CNC-Maschine (1)
- Case Study (1)
- Case-Based Classification Algorithms (1)
- Case-Based Planning (1)
- Case-Based Reasoning Systems (1)
- Case-Based Representability (1)
- Case-based problem solving (1)
- Causal Ordering (1)
- Causality (1)
- Certifying Compilers (1)
- Cochlea Implant (1)
- Cochlea Implantat (1)
- Completion (1)
- Computer assistierte Chirurgie (1)
- Computer assistierte Chirurgie (CAS) (1)
- Concept mapping (1)
- Concept maps (1)
- Constraint Graphs (1)
- Contract net (1)
- Cooperative decision making (1)
- Correlation (1)
- DES (1)
- Datenreduktion (1)
- Declarative and Procedural Knowledge (1)
- Dependency Factors (1)
- Diagnosesystem (1)
- Didaktik (1)
- Difference Reduction (1)
- Distributed Computation (1)
- Distributed Deb (1)
- Distributed Software Development Projects (1)
- Distributed System (1)
- Distributed software development support (1)
- Distributed systems (1)
- Distribution and Combination of Theorem Provers (1)
- EBG (1)
- Ecommerce (1)
- Enterprise modeling (1)
- Enterprise modelling (1)
- Equality reasoning (1)
- Equational Reasoning (1)
- Evaluation (1)
- Fachdidaktik (1)
- Fallbasierte Planung (1)
- Fallbasiertes Planen (1)
- Farbmodell (1)
- Functional Programs (1)
- Gebäude (1)
- Gebäudeautomation (1)
- General Knowledge (1)
- Genetic Algorithm (1)
- Global Predicate Detection (1)
- HTE (1)
- Huffman (1)
- Huffman-Code (1)
- IDEA (1)
- Inductive Theorem Proving (1)
- Induktive Logische Programmierung (1)
- Induktiven Logischen Programmierung (1)
- Instance-based Learning (1)
- Intelligent Agents (1)
- Intelligent Object Fusion (1)
- Intelligent agents (1)
- Interleaved Planning (1)
- Internet Based Software Process Management Environment (1)
- Internet knowledge base (1)
- Internet knowledge reuse (1)
- Jacobian (1)
- KLUEDO (1)
- Knowledge-based Techniques (1)
- Knuth-Bendix completion algorithm (1)
- Komprimierung (1)
- Kryptographie (1)
- Kryptologie (1)
- Laufkomprimierung (1)
- Lernalgorithmen (1)
- Linux (1)
- Logical Time (1)
- Logische Programmierung (1)
- MOO (1)
- MVP-L (1)
- Map Building (1)
- Maturity of Software Engineering (1)
- Methods (1)
- Nearest-Neighbor Classification (1)
- Netzwerk (1)
- Object-OrientedCase Representation (1)
- Ontolingua (1)
- Ontology (1)
- Open-Source (1)
- PABS-Methode (1)
- PARO (1)
- PATDEX 2 (1)
- PERA (1)
- PLAN Abstraction (1)
- Partial functions (1)
- Planning and Verification (1)
- Position- and Orientation Estimation (1)
- Problem Solvers (1)
- Problemlösung (1)
- Process Management (1)
- Process support (1)
- Produktionsdesign (1)
- Project Management (1)
- RGB (1)
- RLE (1)
- RSA (1)
- ReasoningSystems (1)
- Rechnernetze (1)
- Requirements engineering (1)
- Requirements/Specifications (1)
- SCM (1)
- SDL-oriented Object Modeling Technique (1)
- SKALP (1)
- SOMT (1)
- Self-Referencing (1)
- Semantics of Programming Languages (1)
- Server (1)
- Similarity Assessment (1)
- Simulation (1)
- Simultaneous quantifier elimination (1)
- Smalltalk (1)
- Software Configuration Management (1)
- Software Process Support (1)
- Software development (1)
- Software engineering (1)
- Sprachen (1)
- Systemarchitektur (1)
- TCP/IP (1)
- Tactics (1)
- Termination (1)
- Topology Preserving Networks (1)
- Translation Validation (1)
- Unterricht (1)
- Vector Time (1)
- Verteiltes System (1)
- Virtual Corporation (1)
- Virtual Software Projects (1)
- Vision (1)
- WETICE 98 (1)
- Wide Area Multimedia Group Interaction (1)
- Wissenserwerb (1)
- Workflow Replication (1)
- Workflowmanagement (1)
- World Wide Web (1)
- active damping (1)
- adaption (1)
- analogy (1)
- artificial intelligence (1)
- assembly sequence design (1)
- automated code generation (1)
- automated computer learning (1)
- automated proof planner (1)
- automated synchronization (1)
- automated theorem proving (1)
- autonomes Lernen (1)
- autonomous learning (1)
- bidirectional search (1)
- business process modelling (1)
- business process reengineering (1)
- case-based planner (1)
- co-learning (1)
- communication architectures (1)
- communication protocols (1)
- communication subsystem (1)
- compilation (1)
- complex System Development (1)
- computer-supported cooperative work (1)
- concept representation (1)
- conceptual design (1)
- conceptual representation (1)
- concurrent software (1)
- conservative extension (1)
- consistency (1)
- constraint satisfaction problem (CSP) (1)
- constraint-based reasoning (1)
- continuous media (1)
- cooperative problem solving (1)
- customization of communication protocols (1)
- decision support (1)
- deformable object (1)
- description of reactive systems (1)
- design processes (1)
- diagnostic problems (1)
- discretization (1)
- distributed (1)
- distributed c (1)
- distributed deduction (1)
- distributed document management (1)
- distributed enterprise (1)
- distributed groupware environment (1)
- distributed multi-platform software development (1)
- distributed multi-platform software development projects (1)
- distributed software configuration management (1)
- distributed softwaredevelopment tools (1)
- experience base (1)
- experimental software engineering (1)
- fallbasiertes planen (1)
- flexible-link (1)
- flexible-link robot (1)
- formal description techniques (1)
- formal reasoning (1)
- frames (1)
- generic design of a customized communication subsystem (1)
- goal oriented completion (1)
- graph search (1)
- heterogeneous large-scale distributed DBMS (1)
- high-level caching of potentially shared networked documents (1)
- higher order tableau (1)
- higher-order calculi (1)
- higher-order tableaux calculus (1)
- higher-order theorem prover (1)
- industrial robots (1)
- industrial supervision (1)
- information systems engineering (1)
- intelligent agents (1)
- internet event synchronizer (1)
- isochronous streams (1)
- knowledge space (1)
- knowledge-based planning (1)
- konzeptuelle Modelierung (1)
- learning (1)
- learning algorithms (1)
- linked abstraction workflows (1)
- manipulation (1)
- many-valued logic (1)
- middleware (1)
- mobile agents (1)
- mobile agents approach (1)
- modelling time (1)
- monitoring and managing distributed development processes (1)
- motion planning (1)
- multi-agent architecture (1)
- multimedia (1)
- multiple-view product modeling (1)
- narrowing (1)
- natural language semantics (1)
- navigation (1)
- negotiation (1)
- object frameworks (1)
- object-oriented software modeling (1)
- on-line algorithms (1)
- order-sorted logic (1)
- oscillation (1)
- parallel processing (1)
- paramodulation (1)
- path planning (1)
- plan enactment (1)
- planning (1)
- point-to-point (1)
- problem formulation (1)
- problem solvers (1)
- process model (1)
- process modelling (1)
- process support system (PROSYT) (1)
- process-centred environments (1)
- profiles (1)
- programmable client-server systems (1)
- proof presentation (1)
- protocol (1)
- rate control (1)
- reactive systems (1)
- real time (1)
- real-time (1)
- real-time temporal logic (1)
- receptive safety properties (1)
- redundancy (1)
- redundant robots (1)
- rekursiv aufzählbare Sprachfamilien (1)
- reliability (1)
- requirements (1)
- robot (1)
- robot control (1)
- robot kinematics (1)
- rule-based reasoning (1)
- search algorithms (1)
- search-space-problem (1)
- self-localization (1)
- sequent calculus (1)
- similarity measure (1)
- skolemization (1)
- software agents (1)
- software project (1)
- software project management (1)
- software reuse (1)
- state-based formalism (1)
- system behaviour (1)
- tactics (1)
- theorem proving (1)
- topology preserving maps (1)
- typical examples (1)
- verlustfrei (1)
- virtual market place (1)
- visual process modelling environment (1)
- wissensbasierte Systeme (1)
- wissensbasierter Systeme der Arbeitsplanerstellung (1)
- work coordination (1)
- world modelling (1)
- world-modelling (1)
Faculty / Organisational entity
We present a convenient notation for positive/negativeADconditional equations. Theidea is to merge rules specifying the same function by using caseAD, ifAD, matchAD, and letADexpressions.Based on the presented macroADruleADconstruct, positive/negativeADconditional equational specifiADcations can be written on a higher level. A rewrite system translates the macroADruleADconstructsinto positive/negativeADconditional equations.
The Internet has fallen prey to its most successful service, the World-Wide Web. The networksdo not keep up with the demands incurred by the huge amount of Web surfers. Thus, it takeslonger and longer to obtain the information one wants to access via the World-Wide Web.Many solutions to the problem of network congestion have been developed in distributed sys-tems research in general and distributed file and database systems in particular. The introduc-tion of caching and replication strategies has proven to help in many situations and thereforethese techniques are also applied to the WWW. Although most problems and associated solu-tions are known, some circumstances are different with the Web, forcing the adaptation ofknown strategies. This paper gives an overview about these differences and about currentlydeployed, developed, and evaluated solutions.
We have developed a middleware framework for workgroup environments that can support distributed software development and a variety of other application domains requiring document management and change management for distributed projects. The framework enables hypermedia-based integration of arbitrary legacy and new information resources available via a range of protocols, not necessarily known in advance to us as the general framework developers nor even to the environment instance designers. The repositories in which such information resides may be dispersed across the Internet and/or an organizational intranet. The framework also permits a range of client models for user and tool interaction, and applies an extensible suite of collaboration services, including but not limited to multi-participant workflow and coordination, to their information retrievals and updates. That is, the framework is interposed between clients, services and repositories - thus "middleware". We explain how our framework makes it easy to realize a comprehensive collection of workgroup and workflow features we culled from a requirements survey conducted by NASA.
In recent years several computational systems and techniques fortheorem proving by analogy have been developed. The obvious prac-tical question, however, as to whether and when to use analogy hasbeen neglected badly in these developments. This paper addresses thisquestion, identifies situations where analogy is useful, and discussesthe merits of theorem proving by analogy in these situations. Theresults can be generalized to other domains.
In this report we give an overview of the development of our new Waldmeisterprover for equational theories. We elaborate a systematic stepwise design process, startingwith the inference system for unfailing Knuth - Bendix completion and ending up with animplementation which avoids the main diseases today's provers suffer from: overindulgencein time and space.Our design process is based on a logical three - level system model consisting of basicoperations for inference step execution, aggregated inference machine, and overall controlstrategy. Careful analysis of the inference system for unfailing completion has revealed thecrucial points responsible for time and space consumption. For the low level of our model,we introduce specialized data structures and algorithms speeding up the running system andcutting it down in size - both by one order of magnitude compared with standard techniques.Flexible control of the mid - level aggregation inside the resulting prover is made possible by acorresponding set of parameters. Experimental analysis shows that this flexibility is a pointof high importance. We go on with some implementation guidelines we have found valuablein the field of deduction.The resulting new prover shows that our design approach is promising. We compare oursystem's throughput with that of an established system and finally demonstrate how twovery hard problems could be solved by Waldmeister.
Die Verfahren der Induktiven Logischen Programmierung (ILP) [Mug93] haben die Aufgabe, aus einer Menge von positiven Beispielen E+, einer Menge von negativen Beispielen E und dem Hintergrundwissen B ein logisches Programm P zu lernen, das aus einer Menge von definiten Klauseln C : l0 l1, : : : ,ln besteht. Da der Hypothesenraum für Hornlogik unendlich ist, schränken viele Verfahren die Hypothesensprache auf eine endliche ein. Auch wird oft versucht, die Hypothesensprache so einzuschränken, dass nur Programme gelernt werden können, für die die Konsistenz entscheidbar ist. Eine andere Motivation, die Hypothesensprache zu beschränken, ist, dass das Wissen über das Zielprogramm, das schon vorhanden ist, ausgenutzt werden soll. So sind für bestimmte Anwendungen funktionsfreie Hypothesenklauseln ausreichend, oder es ist bekannt, dass das Zielprogramm funktional ist.
Conditional Compilation (CC) is frequently used as a variation mechanism in software product lines (SPLs). However, as a SPL evolves the variable code realized by CC erodes in the sense that it becomes overly complex and difficult to understand and maintain. As a result, the SPL productivity goes down and puts expected advantages more and more at risk. To investigate the variability erosion and keep the productivity above a sufficiently good level, in this paper we 1) investigate several erosion symptoms in an industrial SPL; 2) present a variability improvement process that includes two major improvement strategies. While one strategy is to optimize variable code within the scope of CC, the other strategy is to transition CC to a new variation mechanism called Parameterized Inclusion. Both of these two improvement strategies can be conducted automatically, and the result of CC optimization is provided. Related issues such as applicability and cost of the improvement are also discussed.
We present a distributed system, Dott, for approximately solving the Trav-eling Salesman Problem (TSP) based on the Teamwork method. So-calledexperts and specialists work independently and in parallel for given time pe-riods. For TSP, specialists are tour construction algorithms and experts usemodified genetic algorithms in which after each application of a genetic operatorthe resulting tour is locally optimized before it is added to the population. Aftera given time period the work of each expert and specialist is judged by a referee.A new start population, including selected individuals from each expert and spe-cialist, is generated by the supervisor, based on the judgments of the referees.Our system is able to find better tours than each of the experts or specialistsworking alone. Also results comparable to those of single runs can be found muchfaster by a team.