ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (90)
  • knowledge representation  (90)
  • Springer  (90)
  • Oxford University Press
  • Computer Science  (90)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Information systems frontiers 2 (2000), S. 349-367 
    ISSN: 1572-9419
    Keywords: knowledge management ; software domain ; learning software organization ; knowledge representation ; intelligent retrieval and storage system ; software engineering experience environment
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Due to the steadily increasing demands of the market, strategic management of knowledge assets, or learning organizations, are becoming a must in industrial software development. This paper presents work done at Fraunhofer IESE, where learning organizations for software development organizations are being developed and transferred into industrial practice. It describes how learning organizations for the software domain can be built upon both mature approaches from Software Engineering like the experience factory model and industrial strength technology from knowledge management. A system to support the learning software organization is sketched and experiences regarding the implementation of this system and learning software organizations in general are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 23 (1989), S. 235-250 
    ISSN: 1572-8412
    Keywords: foreign language teaching ; educational technology ; intelligent software ; parsing ; syntax ; natural language understanding ; grammar formalisms ; knowledge representation ; man-machine interaction ; tutoring systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract This paper presents the view that Computer Assisted Language Instruction (CALI) software should be developed as a natural language processing system that offers an interactive environment for language learners. A description of Artificial Intelligence tools and techniques, such as parsing, knowledge representation and expert systems is presented. Their capabilities and limitations are discussed and a model for intelligent CALI software (MICALI) is proposed. MICALI is highly interactive and communicative and can initiate conversation with a student or respond to questions on a previously defined domain of knowledge. In the present state of the art, MICALI can only operate in limited parsing and domain-specific knowledge representation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 25 (1991), S. 1-14 
    ISSN: 1572-8412
    Keywords: Advanced Language System ; natural language processing ; knowledge representation ; discourse structure ; narrative structure ; computer-based fiction ; communicative language learning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract The availability of advanced function workstations makes possible a new medium for the manipulation of language which changes in kind as well as in degree the pedagogic and literary potential of the computer. This article presents a structural/functional analysis of the kind of system that, though still unrealized, is becominig increasingly possible to build: an Advanced Language System that includes natural language processing, knowledge representation, discourse structure, and narrative structure. Communicative language learning and the creation of computer-based fiction are both served by the emergence of this medium. Advanced language systems may include: “ako” links, semantic networks, query, “script,” “analogy,” and character/belief structures. For language learning advanced language systems offer greater error correction and research opportunities and more flexibility in presenting communicative and cultural exercises. For the creation of art, they offer the possibility of creating “round” instead of “flat” characters and “dynamic” rather than static plots. Programs which “learn” offer the possibility of creating literary formulae and even interpretive “traditions” on the computer. Literary invention will always be the key to making such systems effective as art or as aids to communicative learning.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 3 (1993), S. 475-510 
    ISSN: 1572-8641
    Keywords: Inferencing in natural language ; representation of natural language ; Boolean semantics ; negation ; negative information ; modeling natural language ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases. The representation parallels natural language in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and negation in natural language by computable operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. The representation demonstrates that Boolean semantics of natural language can be successfully modeled in terms of representation and inference by knowledge representation formalisms with Boolean semantics. A novel approach to the problem of automatic inferencing in natural language is addressed. The algorithm for updating a computer knowledge base and reasoning with explicit negative, disjunctive, and conjunctive information based on computing subsumption relation between the representations of the appropriate sentential constituents is discussed with examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 4 (1994), S. 59-73 
    ISSN: 1572-8641
    Keywords: Parsing ; knowledge representation ; semantic interpretation ; lambda calculus
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract KRISP is a representation system and set of interpretation protocols that is used in the Sparser natural language understanding system to embody the meaning of texts and their pragmatic contexts. It is based on a denotational notion of semantic interpretation, where the phrases of a text are directly projected onto a largely pre-existing set of individuals and categories in a model, rather than first going through a level of symbolic representation such as a logical form. It defines a small set of semantic object types, grounded in the lambda calculus, and it supports the principle of uniqueness and supplies first class objects to represent partially-saturated relationships. KRISP is being used to develop a core set of concepts for such things as names, amounts, time, and modality, which are part of a few larger models for domains including “Who's News” and joint ventures. It is targeted at the task of information extraction, emphasizing the need to relate entities mentioned in new texts to a large set of pre-defined entities and those read about in earlier articles or in the same article.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 1572-8641
    Keywords: belief networks ; knowledge representation ; agile modeling ; bounded rationality ; decision theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Information is a force multiplier. Knowledge of the enemy's capability and intentions may be of far more value to a military force than additional troops or firepower. Situation assessment is the ongoing process of inferring relevant information about the forces of concern in a military situation. Relevant information can include force types, firepower, location, and past, present and future course of action. Situation assessment involves the incorporation of uncertain evidence from diverse sources. These include photographs, radar scans, and other forms of image intelligence, or IMINT; electronics intelligence, or ELINT, derived from characteristics (e.g., wavelength) of emissions generated by enemy equipment; communications intelligence, or COMINT, derived from the characteristics of messages sent by the enemy; and reports from human informants (HUMINT). These sources must be combined to form a model of the situation. The sheer volume of data, the ubiquity of uncertainty, the number and complexity of hypotheses to consider, the high-stakes environment, the compressed time frame, and deception and damage from hostile forces, combine to present a staggeringly complex problem. Even if one could formulate a decision problem in reasonable time, explicit determination of an optimal decision policy exceeds any reasonable computational resources. While it is tempting to drop any attempt at rational analysis and rely purely on simple heuristics, we argue that this can lead to catastrophic outcomes. We present an architecture for a ``complex decision machine'' that performs rational deliberation to make decisions in real time. We argue that resource limits require such an architecture to be grounded in simple heuristic reactive processes. We thus argue that both simple heuristics and complex decision machines are required for effective decision making in real time for complex problems. We describe an implementation of our architecture applied to the problem of military situation assessment.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 2 (1992), S. 27-49 
    ISSN: 1572-8641
    Keywords: Nonmonotonic ; inference ; logic ; conditionals ; consequence relations ; belief revision ; theory change ; defeasible reasoning ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract Recently, John Bell has proposed that a specific conditional logic, C, be considered as a serious candidate for formally representing and faithfully capturing various (possibly all) formalized notions of nonmonotonic inference. The purpose of the present paper is to develop evaluative criteria for critically assessing such claims. Inference patterns are described in terms of the presence or absence of residual classical monotonicity and intrinsic nonmonotonicity. The concept of a faithful representation is then developed for a formalism purported to encode a pattern of nonmonotonic inference already captured by another. In the main body of the paper these evaluative criteria are applied to assess (negatively) whether C or any conditional logic provides a faithful representation for nonmonotonic patterns of inference captured by inference operators and relations modeling the dynamics of belief change.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 31 (1997), S. 77-90 
    ISSN: 1572-8412
    Keywords: word sense disambiguation ; semantics, grammar ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract This paper addresses the question of whether it is possible tosense-tag systematically, and on a large scale, and how we shouldassess progress so far. That is to say, how to attach each occurrenceof a word in a text to one and only one sense in a dictionary – aparticular dictionary of course, and that is part of the problem. Thepaper does not propose a solution to the question, though we havereported empirical findings elsewhere (Cowie et al., 1992;Wilks et al., 1996; Wilks and Stevenson, 1997), and intend to continue andrefine that work. The point of this paper is to examine two well-knowncontributions critically: The first (Kilgarriff, 1993), which is widelytaken to show that the task, as defined, cannot be carried outsystematically by humans and, secondly (Yarowsky, 1995), which claimsstrikingly good results at doing exactly that.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 4 (1994), S. 303-315 
    ISSN: 1572-8641
    Keywords: Hume ; cognitive science ; history of ; knowledge representation ; functionalism
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract David Hume is widely believed to be one of the founders of functionalism. His principles of association are seen as an early attempt to articulate a mechanics of the mind akin to Newtonian mechanics. It is argued that this view is based on a failure to appreciate that Hume's skepticism about reason extends to our ability to understand the representation of everyday knowledge. For Hume there are “secret operations” of the mind, operations for which functional explanations are not forthcoming. Hume's place in the history of cognitive science is reevaluated in light of his views on common sense knowledge and belief formation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1572-8382
    Keywords: knowledge representation ; natural language ; thesaurus ; vector space ; text retrieval
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 3 (1995), S. 97-142 
    ISSN: 1572-8382
    Keywords: integrated ; natural language ; hypertext ; document assembly ; knowledge representation ; expert system ; text retrieval
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract There is more to legal knowledge representation than knowledge-bases. It is valuable to look at legal knowledge representation and its implementation across the entire domain of ‘computerisation of law’, rather than focussing on sub-domains such as ‘legal expert systems’. The DataLex WorkStation software and applications developed using it are used to provide examples. Effective integration of inferencing, hypertext and text retrieval can overcome some of the limitations of these current paradigms of legal computerisation which are apparent when they are used on a ‘stand-alone’ basis. Effective integration of inferencing systems is facilitated by use of a (quasi) natural language knowledge representation, and the benefits of isomorphism are enhanced. These advantages of integration apply to all forms of inferencing, including document generation and casebased inferencing. Some principles for development of integrated legal decision support systems are proposed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 5 (1997), S. 77-96 
    ISSN: 1572-8382
    Keywords: legal reasoning ; CISG ; knowledge representation ; logic ; compound predicate formula
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract In order to represent legal knowledge adequately, it is vital to create a formal device that can freely construct an individual concept directly from a predicate expression. For this purpose, a Compound Predicate Formula (CPF) is formulated for use in legal expert systems. In this paper, we willattempt to explain the nature of CPFs by rigorous logical foundation, i.e., establishing their syntax and semantics precisely through the use of appropriate examples. We note the advantages of our system over other such systems and discuss the significance of CPFs with regard to the formalization of legal reasonings using examples from the United Nations Convention for the International Sale of Goods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 1 (1992), S. 245-274 
    ISSN: 1572-8382
    Keywords: legal knowledge sources ; metaknowledge ; levels of knowledge ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract This paper presents a four layer model for working with legal knowledge in expert systems. It distinguishes five sources of knowledge. Four contain basic legal knowledge found in published and unpublished sources. The fifth consists of legal metaknowledge. In the model the four basic legal knowledge sources are placed at the lowest level. The metaknowledge is placed at levels above the other four knowledge sources. The assumption is that the knowledge is represented only once. The use of metaknowledge at various levels should make it possible to use the appropriate knowledge for the problem presented to the system. The knowledge has to be represented as closely to the original format as possible for this purpose. Suitable representation formalisms for the various types of knowledge in the five knowledge sources are discussed. It is not possible to indicate a ‘best’ representation formalism for each knowledge source.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence and law 2 (1993), S. 83-111 
    ISSN: 1572-8382
    Keywords: Issue spotting ; torts ; case-based reasoning ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Law
    Notes: Abstract For any system that uses previous experience to solve problems in new situations, it is necessary to identify the features in the situation that should match features in the previous cases through some process ofsituation analysis. In this paper, we examine this problem in the legal domain, where lawyers know it asissue spotting. In particular, we present an implementation of issue spotting in CHASER, a legal reasoning system that works in the domain of tort law. This approach is a compromise between generality and efficiency, and is applicable to a range of problems and domains besides legal reasoning. In particular, it presents a principled way to use multiple cases for a single problem by exploiting the inherent structure present in many domains.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 27 (1993), S. 261-275 
    ISSN: 1572-8412
    Keywords: conceptual analysis ; knowledge representation ; knowledge engineering ; semantic networks ; text analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract This article addresses the methodological problem of the non-linear representation of philosophical systems in a computerized knowledge base. It is a problem of knowledge representation as defined in the field of artificial intelligence. Instead of a purely theoretical discussion of the issue, we present selected results of a practical experiment which has in itself some theoretical significance. We show how one can represent different philosophies using CODE, a knowledge engineering system developed by artificial intelligence researchers. The hypothesis is that such a computer based representation of philosophical systems can give insight into their conceptual structure. We argue that computer aided text analysis can apply knowledge representation tools and techniques developed in artificial intelligence and we estimate how philosophers as well as knowledge engineers could gain from this cross-fertilization. This paper should be considered as an experiment report on the use of knowledge representation techniques in computer aided text analysis. It is part of a much broader project on the representation of conceptual structures in an expert system. However, we intentionally avoided technical issues related to either Computer Science or History of Philosophy to focus on the benefit to enhance traditional humanistic studies with tools and methods developed in AI on the one hand and the need to develop more appropriate tools on the other.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 5 (1995), S. 309-337 
    ISSN: 1572-8641
    Keywords: Folk psychology ; modularity ; defeasible reasoning ; knowledge representation ; propositional attitudes ; language ; cognition ; perception ; functional architecture
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract It is often assumed that cognitive science is built upon folk psychology, and that challenges to folk psychology are therefore challenges to cognitive science itself. We argue that, in practice, cognitive science and folk psychology treat entirely non-overlapping domains: cognitive science considers aspects of mental life which do not depend on general knowledge, whereas folk psychology considers aspects of mental life which do depend on general knowledge. We back up our argument on theoretical grounds, and also illustrate the separation between cognitive scientific and folk psychological phenomena in a number of cognitive domains. We consider the methodological and theoretical significance of our arguments for cognitive science research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 7 (1997), S. 249-267 
    ISSN: 1572-8641
    Keywords: concept ; defeasible ; knowledge representation ; logic ; meaning ; mental model ; perspective ; psychology ; theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract This paper discusses how we understand and use a concept or the meaningof a general term to identify the objects falling under the term. There aretwo distinct approaches to research on the problems of concepts and meaningthe psychological approach and the formal (or logical) approach. My majorconcern is to consider the possibility of reconciling these two differentapproaches, and for this I propose to build a psychologically plausibleformal system of conceptualization. That is, I will develop a theory-basedaccount of concepts and propose an explanation of how an agent activates aperspective (which consists of theories) in response to a situation in whichreasoning using a concept is called for. Theories are represented as sets offacts and rules, both strict and defeasible. Each theory is organized in acoherent perspective which stands for an agent's mental state or an agent'smodel of another agent's perspective. Perspectives are organized intohierarchies and the theory for a concept in one perspective may defeat thetheory for the same concept in another perspective. Which perspective issuperior is context-dependent.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 3 (1990), S. 167-182 
    ISSN: 1573-0409
    Keywords: Legal reasoning ; knowledge representation ; facts extraction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In knowledge-based consultation systems, the quality of the advice rendered depends on the techniques employed to represent the domain knowledge, the explanation generating capabilities, and the control strategies utilized during the consultative advice stage. The ability to understand the problem is more crucial in providing effective consultation. In this work, the emphasis is on understanding and the consequent formulation of a plausible internal representation of legal briefs. The system developed, SIFTER, reads the given input text from a legal practitioner's point of view and retrieves from it those facts that are relevant to the particular type of case on hand. In other words, it uses the domain specific knowledge to identify the type of case and to yank out the necessary information pertaining to the case. The SIFTER generates a noun-phrase processed form of the input which contains pseudo names for the proper-nouns, dates and time-intervals. The verbs in the processed input are used to check whether the case specific events have occurred or not and then the appropriate fact-containing noun-phrases are used to instantiate the relevant legal variables and, hence, to construct an internal representation of the given problem which can then be readily used by the consultative advice stage of a problem solver or analyzer. The implementation has been done in LISP culling the required domain knowledge from the Industrial Dispute Act of India.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Machine translation 5 (1990), S. 57-78 
    ISSN: 1573-0573
    Keywords: concepts ; English ; first-order logic ; knowledge representation ; lexical selection ; meaning postulates ; natural-language generation ; nouns
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Notes: Abstract The task of natural language generation by computer requires a method for the selection of lexical items that refer to concepts. A generation system cannot assume that every concept will have an appropriate lexical entry associated with it. Similarly, a generation system must avoid redundant text and must strive for the most specific descriptions possible. This paper presents an algorithm for lexical selection that takes advantage of a conceptual network in which we represent the relationships between concepts (such as which concepts subsume each other and what differentiates concepts at different levels of generality). When the algorithm chooses a lexical realization for a concept, it first checks to see if the concept to be expressed is associated with a lexical entry. If so, that entry is used. If the concept does not have the appropriate lexical associations, the algorithm generates a phrase with a more general head term and restrictive modifiers. It does this by using the conceptual network to compute a semantically appropriate head term, and then modifying the request for generation by adding restrictions that differentiate the concept associated with the head term from the concept initially requested. Similarly, the conceptual network is used to eliminate redundant modifiers by computing the information contained in a lexical item that is chosen as a head term. Here the algorithm modifies the generation request to avoid restating the extra information. This algorithm is being implemented within Penman, a computerized system for the generation of English text from statements in a first-order predicate calculus language.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 3 (1990), S. 3-16 
    ISSN: 1573-0409
    Keywords: Electronic assembly planning ; knowledge representation ; process plans
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The conventional method of electronic assembly planning is subjective and depends greatly on the skills, memory, knowledge and experience of the planners. This gives rise to inconsistencies which in turn create problems in the manufacturing environment. Since the computer logics are systematic and consistent, it is conceivable that an automatic electronic assembly planning system would have advances over manual systems. Due to the frequent advances in technology the electronic industry is a very dynamic one. This affects the effectiveness of the current process plans and the applicability of the system that generates them. In this paper important issues which address the automatic generation of process plans will be presented. The framework of a system which takes into account the dynamic nature of the environment will be introduced as an example.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 4 (1991), S. 99-107 
    ISSN: 1573-0409
    Keywords: Expert system ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper describes the design and development of an expert system that aids in the recommendation of computer access technology visual aids for the severely visually handicapped. The primary focus here is on a description of the frame structure used to represent the knowledge base and the accompanying search strategy which takes advantage of this frame structure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 1 (1988), S. 145-161 
    ISSN: 1573-0409
    Keywords: Fault detection ; isolation and identification ; restructurable control ; artificial intelligence ; failure diagnosis ; expert systems ; knowledge representation ; shallow knowledge ; deep knowledge ; intelligent systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The fault detection and identification problem in an intelligent restructurable controller is addressed using a combination of algorithmic and artificial intelligence methods. An architecture is developed to address this problem. The integration of a variety of distinct knowledge representations and diagnostic reasoning techniques, and the system design and implementation is facilitated by the introduction of a novel knowledge representation graph.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 1 (1988), S. 103-116 
    ISSN: 1573-0409
    Keywords: Artificial intelligence ; sensor fusion ; vision ; knowledge representation ; registration ; sensors ; signal processing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper reviews some knowledge representation approaches devoted to the sensor fusion problem, as encountered whenever images, signals, text must be combined to provide the input to a controller or to an inference procedure. The basic steps involved in the derivation of the knowledge representation scheme, are: (A) locate a representation, based on exogeneous context information (B) compare two representations to find out if they refer to the same object/entity (C) merge sensor-based features from the various representations of the same object into a new set of features or attributes, (D) aggregate the representations into a joint fused representation, usually more abstract than each of the sensor-related representations. The importance of sensor fusion stems first from the fact that it is generally correct to assume that improvements in control law simplicity and robustness, as well as better classification results, can be achieved by combining diverse information sources. The second element, is that, e.g., spatially distributed sensing, or otherwise diverse sensing, does indeed require fusion as well.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 10 (1994), S. 113-145 
    ISSN: 1573-0409
    Keywords: Artificial intelligence ; knowledge-based expert systems ; knowledge representation ; expert system development tools ; knowledge ; engineering based expert systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This survey paper presents a thorough description of fundamentals of engineering based expert systems and their knowledge representation techniques. The most important expert system development tools and existing operational expert systems in many different engineering domains are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 4 (1989), S. 293-336 
    ISSN: 0885-6125
    Keywords: knowledge acquisition ; knowledge engineering ; human-computer interaction ; strategic knowledge ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Strategic knowledge is used by an agent to decide what action to perform next, where actions have consequences external to the agent. This article presents a computer-mediated method for acquiring strategic knowledge. The general knowledge acquisition problem and the special difficulties of acquiring strategic knowledge are analyzed in terms of representation mismatch: the difference between the form in which knowledge is available from the world and the form required for knowledge systems. ASK is an interactive knowledge acquisition tool that elicits strategic knowledge from people in the form of justifications for action choices and generates strategy rules that operationalize and generalize the expert's advice. The basic approach is demonstrated with a human-computer dialog in which ASK acquires strategic knowledge for medical diagnosis and treatment. The rationale for and consequences of specific design decisions in ASK are analyzed, and the scope of applicability and limitations of the approach are assessed. The paper concludes by discussing the contribution of knowledge representation to automated knowledge acquisition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 15 (1994), S. 223-250 
    ISSN: 0885-6125
    Keywords: decision trees ; knowledge representation ; pruning ; dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract When communicating concepts, it is often convenient or even necessary to define a concept approximately. A simple, although only approximately accurate concept definition may be more useful than a completely accurate definition which involves a lot of detail. This paper addresses the problem: given a completely accurate, but complex, definition of a concept, simplify the definition, possibly at the expense of accuracy, so that the simplified definition still corresponds to the concept “sufficiently” well. Concepts are represented by decision trees, and the method of simplification is tree pruning. Given a decision tree that accurately specifies a concept, the problem is to find a smallest pruned tree that still represents the concept within some specified accuracy. A pruning algorithm is presented that finds an optimal solution by generating adense sequence of pruned trees, decreasing in size, such that each tree has the highest accuracy among all the possible pruned trees of the same size. An efficient implementation of the algorithm, based on dynamic programming, is presented and empirically compared with three progressive pruning algorithms using both artificial and real-world data. An interesting empirical finding is that the real-world data generally allow significantly greater simplification at equal loss of accuracy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 27 (1997), S. 241-257 
    ISSN: 0885-6125
    Keywords: Multistrategy learning ; inductive logic programming ; background knowledge ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper discusses the role that background knowledge can play in building flexible multistrategy learning systems. We contend that a variety of learning strategies can be embodied in the background knowledge provided to a general purpose learning algorithm. To be effective, the general purpose algorithm must have a mechanism for learning new concept descriptions that can refer to knowledge provided by the user or learned during some other task. The method of knowledge representation is a central problem in designing such a system since it should be possible to specify background knowledge in such a way that the learner can apply its knowledge to new information.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 21 (1995), S. 125-150 
    ISSN: 0885-6125
    Keywords: protein tertiary structure ; machine discovery ; relational learning ; knowledge representation ; description logics ; information retrieval ; knowledge discovery in databases
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The investigation of relations between protein tertiary structure and amino acid sequence is a topic of tremendous importance in molecular biology. The automated discovery of recurrent patterns of structure and sequence is an essential part of this investigation. These patterns, known as protein motifs, are abstractions of fragments drawn from proteins of known sequence and tertiary structure. This paper has two objectives. The first is to introduce and define protein motifs, and provide a survey of previous research on protein motif discovery. The second is to present and apply a novel approach to protein motif representation and discovery, which is based on a spatial description logic and the symbolic machine learning paradigm of structured concept formation. A large database of protein fragments is processed using this approach, and several interesting and significant protein motifs are discovered.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 15 (1994), S. 223-250 
    ISSN: 0885-6125
    Keywords: decision trees ; knowledge representation ; pruning ; dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract When communicating concepts, it is often convenient or even necessary to define a concept approximately. A simple, although only approximately accurate concept definition may be more useful than a completely accurate definition which involves a lot of detail. This paper addresses the problem: given a completely accurate, but complex, definition of a concept, simplify the definition, possibly at the expense of accuracy, so that the simplified definition still corresponds to the concept “sufficiently” well. Concepts are represented by decision trees, and the method of simplification is tree pruning. Given a decision tree that accurately specifies a concept, the problem is to find a smallest pruned tree that still represents the concept within some specified accuracy. A pruning algorithm is presented that finds an optimal solution by generating a dense sequence of pruned trees, decreasing in size, such that each tree has the highest accuracy among all the possible pruned trees of the same size. An efficient implementation of the algorithm, based on dynamic programming, is presented and empirically compared with three progressive pruning algorithms using both artificial and real-world data. An interesting empirical finding is that the real-world data generally allow significantly greater simplification at equal loss of accuracy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 4 (1989), S. 293-336 
    ISSN: 0885-6125
    Keywords: knowledge acquisition ; knowledge engineering ; human–computer interaction ; strategic knowledge ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Strategic knowledge is used by an agent to decide what action to perform next, where actions have consequences external to the agent. This article presents a computer-mediated method for acquiring strategic knowledge. The general knowledge acquisition problem and the special difficulties of acquiring strategic knowledge are analyzed in terms of representation mismatch: the difference between the form in which knowledge is available from the world and the form required for knowledge systems. ASK is an interactive knowledge acquisition tool that elicits strategic knowledge from people in the form of justifications for action choices and generates strategy rules that operationalize and generalize the expert's advice. The basic approach is demonstrated with a human–computer dialog in which ASK acquires strategic knowledge for medical diagnosis and treatment. The rationale for and consequences of specific design decisions in ASK are analyzed, and the scope of applicability and limitations of the approach are assessed. The paper concludes by discussing the contribution of knowledge representation to automated knowledge acquisition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 21 (1995), S. 125-150 
    ISSN: 0885-6125
    Keywords: protein tertiary structure ; machine discovery ; relational learning ; knowledge representation ; description logics ; information retrieval ; knowledge discovery in databases
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The investigation of relations between protein tertiary structure and amino acid sequence is a topic of tremendous importance in molecular biology. The automated discovery of recurrent patterns of structure and sequence is an essential part of this investigation. These patterns, known asprotein motifs, are abstractions of fragments drawn from proteins of known sequence and tertiary structure. This paper has two objectives. The first is to introduce and define protein motifs, and provide a survey of previous research on protein motif discovery. The second is to present and apply a novel approach to protein motif representation and discovery, which is based on aspatial description logic and the symbolic machine learning paradigm of structured concept formation. A large database of protein fragments is processed using this approach, and several interesting and significant protein motifs are discovered.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 30 (2000), S. 53-92 
    ISSN: 1573-7470
    Keywords: knowledge representation ; temporal reasoning ; time representation ; time granularity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities. The main goals are having a common framework for their specification, and allowing the interoperability of systems adopting different time granularities. This paper considers the mathematical characterization of finite and periodic time granularities, and investigates the requirements for a user-friendly symbolic formalism that could be used for their specification. Instead of proposing yet another formalism, the paper analyzes the expressiveness of known symbolic formalisms for the representation of granularities, using the mathematical characterization as a reference model. Based on this analysis, a significant extension to the collection formalism defined in [15] is proposed, in order to capture a practically interesting class of periodic granularities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Computational economics 4 (1991), S. 151-163 
    ISSN: 1572-9974
    Keywords: Expert database systems ; mathematical logic and logic programming ; decision support ; travel ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Economics
    Notes: Abstract L-CATA (Logic-based Computer Aided Travel Assistant) is a logic-based expert database system, which asks the user to input his query specification, such as starting place, destination, constraints, rules and goals, etc., and outputs a list of flights meeting the traveller's specification; together with an alternative list which may not quite meet the user's specification but optimizes his goals. L-CATA is written as a deductive database system, and uses heuristic rules to prune its search of the database. Unlike other air-travel related expert systems, L-CATA does not attempt to model the traveller. Instead, L-CATA complements existing Computer Reservation Systems by providing comprehensive individually tailored advice and information to the traveller. There are several approaches to implement such a system. The logic approach is a very promising one, and the aims of L-CATA can be more easily achieved by using it. In this paper, we present a logic approach to the L-CATA expert database system, and provide a theoretical foundation for such a database system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Journal of systems integration 8 (1998), S. 287-312 
    ISSN: 1573-8787
    Keywords: document filing ; storage system ; knowledge representation ; knowledge acquisition ; document modeling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a knowledge-based approach to managing and retrieving personal documents. The dual document models consist of a document type hierarchy and a folder organization. The document type hierarchy is used to capture the layout, logical and conceptual structures of documents. The folder organization mimics the user's real-world document filing system for organizing and storing documents in an office environment. Predicate-based representation of documents is formalized for specifying knowledge about documents. Document filing and retrieval are predicate-driven. The filing criteria for the folders, which are specified in terms of predicates, govern the grouping of frame instances, regardless of their document types. We incorporated the notions of document type hierarchy and folder organization into the multilevel architecture of document storage. This architecture supports various text-based information retrieval techniques and content-based multimedia information retrieval techniques. The paper also proposes a knowledge-based query-preprocessing algorithm, which reduces the search space. For automating the document filing and retrieval, a predicate evaluation engine with a knowledge base is proposed. The learning agent is responsible for acquiring the knowledge needed by the evaluation engine.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 12 (1998), S. 431-443 
    ISSN: 1573-7462
    Keywords: autoepistemic logic ; knowledge representation ; nonmonotonic reasoning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The subject of nonmonotonic reasoning is reasoning with incompleteinformation. One of the main approaches is autoepistemic logic inwhich reasoning is based on introspection. This paper aims at providing a smooth introduction to this logic,stressing its motivation and basic concepts. The meaning (semantics)of autoepistemic logic is given in terms of so-called expansionswhich are usually defined as solutions of a fixed-point equation. Thepresent paper shows a more understandable, operational method fordetermining expansions. By improving applicability of the basicconcepts to concrete examples, we hope to make a contribution to awider usage of autoepistemic logic in practical applications.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 7 (1993), S. 227-240 
    ISSN: 1573-7462
    Keywords: adaptive systems ; student models ; intelligent tutoring systems ; knowledge representation ; learner based modelling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Student modelling is a special type of user modelling which is relevant to the adaptability of intelligent tutoring systems. This paper reviews the basic techniques which have been used in student modelling and discusses issues and approaches of current interest. The role of a student model in a tutoring system and methods for representing information about students are discussed. The paper concludes with an overview of some unresolved issues and problems in student modelling.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 11 (1999), S. 5-13 
    ISSN: 1573-7497
    Keywords: neural networks ; knowledge representation ; structured knowledge reasoning ; connectionism ; symbol processing ; hybrid systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This collection of articles is the first of two parts of a special issue on “Neural Networks and Structured Knowledge.” The contributions to the first part shed some light on the issues of knowledge representation and reasoning with neural networks. Their scope ranges from formal models for mapping discrete structures like graphs or logical formulae onto different types of neural networks, to the construction of practical systems for various types of reasoning. In the second part to follow, the emphasis will be on the extraction of knowledge from neural networks, and on applications of neural networks and structured knowledge to practical tasks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 12 (2000), S. 7-13 
    ISSN: 1573-7497
    Keywords: neural networks ; rule extraction ; knowledge representation ; structured knowledge ; connectionism ; hybrid systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract As the second part of a special issue on “Neural Networks and Structured Knowledge,” the contributions collected here concentrate on the extraction of knowledge, particularly in the form of rules, from neural networks, and on applications relying on the representation and processing of structured knowledge by neural networks. The transformation of the low-level internal representation in a neural network into higher-level knowledge or information that can be interpreted more easily by humans and integrated with symbol-oriented mechanisms is the subject of the first group of papers. The second group of papers uses specific applications as starting point, and describes approaches based on neural networks for the knowledge representation required to solve crucial tasks in the respective application. The companion first part of the special issue [1] contains papers dealing with representation and reasoning issues on the basis of neural networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 4 (1994), S. 157-184 
    ISSN: 1573-7497
    Keywords: Constraint satisfaction ; object-oriented programming ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article gives a detailed presentation of constraint satisfaction in the hybrid LAURE language. LAURE is an object-oriented language for Artificial Intelligence (AI) applications that allows the user to combine rules, constraints, and methods that cooperate on the same objects in the same program. We illustrate why this extensibility is necessary to solve some large and difficult problems by presenting a real-life application of LAURE. We describe the syntax and the various modes in which constraints may be used, as well as the tools that are proposed by LAURE to extend constraint resolution. The resolution strategy as well as some implementation details are given to explain how we obtain good performances.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 15 (2000), S. 287-307 
    ISSN: 1573-7675
    Keywords: information retrieval ; knowledge representation ; document bases ; query languages
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Much information is nowadays stored electronically in document bases. Users retrieve information from these document bases by browsing and querying. While a large number of tools are available nowadays, not much work has been done on tools that support queries involving all the characteristics of documents as well as the use of domain knowledge during the search for information. In this paper we propose a query language that allows for querying documents using content information, information about the logical structure of the documents as well as information about properties of the documents. Domain knowledge is taken into account during the search as well. We also present an architecture for a system supporting such a language and we describe a prototype implementation together with test results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 14 (2000), S. 131-154 
    ISSN: 1573-7675
    Keywords: content-based access of images ; image representation ; intelligent information retrieval ; knowledge representation ; image databases ; query containment ; description logics ; intentional reasoning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The problem of content management of multimedia data types (e.g., image, video, graphics) is becoming increasingly important with the development of advanced multimedia applications. Traditional database management systems are inadequate for the handling of such data types. They require new techniques for query formulation, retrieval, evaluation, and navigation. In this paper we develop a knowledge-based framework for modeling and retrieving image data by content. To represent the various aspects of an image object's characteristics, we propose a model which consists of three layers: (1) Feature & Content Layer, intended to contain image visual features such as contours, shapes, etc.; (2) Object Layer, which provides the (conceptual) content dimension of images; and (3) Schema Layer, which contains the structured abstractions of images, i.e., a general schema about the classes of objects represented in the object layer. We propose two abstract languages on the basis of description logics: one for describing knowledge of the object and schema layers, and the other, more expressive, for making queries. Queries can refer to the form dimension (i.e., information of the Feature & Content Layer) or to the content dimension (i.e., information of the Object Layer). These languages employ a variable free notation. As the amount of information contained in the previous layers may be huge and operations performed at the Feature & Content Layer are time-consuming, resorting to the use of materialized views to process and optimize queries may be extremely useful. For that, we propose a formal framework for testing containment of a query in a view expressed in our query language.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 10 (1996), S. 345-368 
    ISSN: 1573-7462
    Keywords: knowledge representation ; hybrid structural and spatial representations ; situated communication
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In an experimental setting of mechanical-object assembly, the CODY (“Concept Dynamics”) project is concerned with the development of knowledge representations and inference methods that are able to dynamically conceptualize the situation in the task environment. A central aim is to enable an artificial agent to understand and process natural-language instructions of a human partner. Instructions may build on the current perception of the assembly environment on the one hand, and on the other on the knowledge-based understanding of grouped structures in the developing construct. To this end, a dynamic conceptualization must integrate information not only describing the types of the objects involved, but also their changing functional roles when becoming part of structured assemblies. We have developed an operational knowledge representation formalism, COAR (“Concepts for Objects, Assemblies, and Roles”), by which processes of dynamic conceptualization in sequences of assembly steps can be formally reconstructed. Inferences concern the assertion or retraction of aggregate representations in a dynamic knowledge base, as well as the computation of role changes for individual objects associated herewith. The structural representations integrate situated spatial features and relations, such as position, size, distance, or orthogonality, which are inferred on need from a geometry description of the task environment. The capacity of our approach has been evaluated in a 3D computergraphics simulation environment. 1 A running demonstration of the virtual assembly workbench can be seen in our contribution to the IJCAI-95 Videotape Program, cf. (Cao et al., 1995). 2 Some readers may still want to refer to this “false” propeller as a propeller. This is not the point in our current work. Our point is to provide means for recognizing a propeller that is correctly built according to its definition. Should the right-hand-side assemblage in Fig. 4 be recognizable as a propeller, we could allow for an according “slack” in the routine which evaluates orthogonality. Yet another point is how reference could be established to the right-hand-side assemblage by a description like “the propeller on the right”. This topic concerns future work.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 14 (2000), S. 43-88 
    ISSN: 1573-7462
    Keywords: agent ; UNIX ; consultant ; natural language ; intelligent interface ; planning ; knowledge representation ; user modeling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract UC (UNIX Consultant) is an intelligent, natural-language interface thatallows naive users to learn about the UNIX operating system. UC wasundertaken because the task was thought to be both a fertile domain forArtificial Intelligence research and a useful application of AI work inplanning, reasoning, natural language processing, and knowledgerepresentation. The current implementation of UC comprises the followingcomponents: A language analyzer, called ALANA, that produces arepresentation of the content contained in an utterance; aninference component called a concretion mechanism that furtherrefines this content; a goal analyzer, PAGAN, that hypothesizes theplans and goals under which the user is operating; an agent, calledUCEgo, that decides on UC's goals and proposes plans for them; adomain planner, called KIP, that computes a plan to address the user'srequest; an expression mechanism, UCExpress, that determines thecontent to be communicated to the user, and a language productionmechanism, UCGen, that expresses UC's response in English. UC alsocontains a component called KNOME that builds a model of the user'sknowledge state with respect to UNIX. Another mechanism, UCTeacher,allows a user to add knowledge of both English vocabulary and factsabout UNIX to UC's knowledge base. This is done by interacting with theuser in natural language. All these aspects of UC make use of knowledgerepresented in a knowledge representation system called KODIAK. KODIAKis a relation-oriented system that is intended to have widerepresentational range and a clear semantics, while maintaining acognitive appeal. All of UC's knowledge, ranging from its most generalconcepts to the content of a particular utterance, is represented inKODIAK.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 14 (2000), S. 377-401 
    ISSN: 1573-7462
    Keywords: knowledge representation ; metaphor ; natural language processing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The language used to describe technical domains like UNIX is filled with metaphor. An approach to metaphor, based on theexplicit representation of knowledge about metaphors, has beendeveloped. MIDAS (Metaphor Interpretation, Denotation, andAcquisition System) is a computer program that that has been developedbased upon this approach. MIDAS can be used to representknowledge about conventional metaphors, interpret metaphoric languageby applying this knowledge, and dynamically learn new metaphors asthey are encountered during normal processing.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 8 (1994), S. 279-308 
    ISSN: 1573-7462
    Keywords: set theory ; commonsense reasoning ; knowledge representation ; cumulative hierarchy ; self-reference ; hypersets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The success of set theory as a foundation for mathematics inspires its use in artificial intelligence, particularly in commonsense reasoning. In this survey, we briefly review classical set theory from an AI perspective, and then consider alternative set theories. Desirable properties of a possible commonsense set theory are investigated, treating different aspects like cumulative hierarchy, self-reference, cardinality, etc. Assorted examples from the ground-breaking research on the subject are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 8 (1994), S. 431-445 
    ISSN: 1573-7462
    Keywords: multimodal interaction ; knowledge representation ; natural language semantics ; pragmatics ; type theory ; object oriented animation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we present the basic principles underlying the DenK-system, a generic cooperative interface combining linguistic and visual interaction. The system integrates results from fundamental research in knowledge representation, communication, natural language semantics and pragmatics, and object-oriented animation. Our design incorporates a cooperative and knowledgeable electronic assistant that communicates with a user in natural language, and an application domain, which is presented visually. The assistant, that we call thecooperator, has an information state that is represented in a rich form of Type Theory, a formalism that enables us to model the inherent cognitive dynamics of a dialogue participant. Pragmatic issues in man-machine interaction, concerning the use of natural language and knowledge in cooperative communication, are central to our approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 6 (1992), S. 365-381 
    ISSN: 1573-7462
    Keywords: natural language ; grammar ; parsing ; knowledge representation ; constituent structure ; feature structures ; unification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Computational linguists require descriptively powerful, computationally effective formalisms for representing grammatical information or knowledge. A wide variety of formalisms have been employed in natural language processing systems over the past several decades, including simple phrase structure grammars, augmented transition networks, logic grammars and unification-based grammar formalisms. Until fairly recently however, comparatively little attention has been given to the issues which underly good grammar formalism design in computational linguistics. This paper examines a number of fundamental issues in the design of formalisms for representing grammatical knowledge. We begin by examining the role of grammar formalisms in computational linguistics, and the trend towards declarative descriptions of grammar. Grammar formalism design is then considered with respect to choices of linguistic representation and grammar notation. The consequences of some specific design choices for the linguistic and computational utility of grammar formalisms are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 7 (1993), S. 157-184 
    ISSN: 1573-7462
    Keywords: adaptive system ; user models ; intelligent interfaces ; knowledge representation ; user modelling shells
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract User modelling is becoming an important sub-area of Artificial Intelligence with both theoretical and practical consequences. The theoretical foundations of user modelling are to be found in key areas of AI, such as knowledge representation and plan recognition, while its practical applications impinge on the construction of intelligent user interfaces and adaptive systems. This paper provides a survey of current work in user modelling. The paper begins by distinguishing between AI approaches, which are the subject of this survey, and those of HCI (Human-Computer Interaction) and then considers the major issues in user modelling such as: types of user modelling system, the sorts of information modelled, how the information is acquired, represented and used. The paper concludes by examining some of the more problematic aspects of user modelling as well as indicating areas for future research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 8 (1994), S. 17-54 
    ISSN: 1573-7462
    Keywords: machine learning ; natural language processing ; cognitive modelling ; knowledge acquisition ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A fundamental issue in natural language processing is the prerequisite of an enormous quantity of preprogrammed knowledge concerning both the language and the domain under examination. Manual acquisition of this knowledge is tedious and error prone. Development of an automated acquisition process would prove invaluable. This paper references and overviews a range of the systems that have been developed in the domain of machine learning and natural language processing. Each system is categorised into either a symbolic or connectionist paradigm, and has its own characteristics and limitations described.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 1 (1991), S. 223-245 
    ISSN: 1573-7497
    Keywords: Heterogeneous expert systems ; knowledge sharing ; rule-based systems ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Solving problems in a complex application domain often requires a seamles integration of some existing knowledge derivation systems which have been independently developed for solving subproblems using different inferencing schemes. This paper presents the design and implementation of an Integrated Knowledge Derivation System (IKDS) which allows the user to query against a global database containing data derivable by the rules and constraints of a number of cooperative heterogeneous systems. The global knowledge representation scheme, the global knowledge manipulation language and the global knowledge processing mechanism of IKDS are described in detail. For global knowledge representation, the dynamic aspects of knowledge such as derivational relationships and restrictive dependencies among data items are modeled by a Function Graph to uniformly represent the capabilities (or knowledge) of the rule-based systems, while the usual static aspects such as data items and their structural interrelationships are modeled by an object-oriented model. For knowledge manipulation, three types of high-level, exploratory queries are introduced to allow the user to query the global knowledge base. For deriving the best global answers for queries, the global knowledge processing mechanism allows the rules and constraints in different component systems to be indiscriminately exploited despite the incompatibilities in their inferencing mechanisms and interpretation schemes. Several key algorithms required for the knowledge processing mechanism are described in this paper. The main advantage of this integration approach is that rules and constraints can in effect be shared among heterogeneous rule-based systems so that they can freely exchange their data and operate as parts of a single system. IKDS achieves the integration at the rule level instead of at the system level. It has been implemented in C running in a network of heterogenous component systems which contain three independently developed expert systems with different rule formats and inferencing mechanisms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 1 (1992), S. 9-34 
    ISSN: 1573-7675
    Keywords: knowledge acquisition ; knowledge representation ; machine learning ; hypermedia
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An architecture for knowledge acquisition systems is proposed based upon the integration of existing methodologies, techniques and tools which have been developed within the knowledge acquisition, machine learning, expert systems, hypermedia and knowledge representation research communities. Existing tools are analyzed within a common framework to show that their integration can be achieved in a natural and principled fashion. A system design is synthesized from what already exists, putting a diversity of well-founded and widely used approaches to knowledge acquisition within an integrative framework. The design is intended to be clean and simple, easy to understand, and easy to implement. A detailed architecture for integrated knowledge acquisition systems is proposed that also derives from parallel cognitive and theoretical studies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 2 (1993), S. 207-223 
    ISSN: 1573-7675
    Keywords: knowledge engineering ; knowledge base management ; knowledge representation ; database constraints ; integrity maintenance ; rule base
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Knowledge has many components such as data, constraints, queries, transactions, and derivation rules. Data is the only component that can be managed effectively in large quantities. All other components are in their infancy in terms of tools and techniques for efficient storage and retrieval, implementation and execution, and user specification and design. One approach to manage all components of knowledge in large quantities is to reduce them all to data. Many components of knowledge can be expressed in terms of examples, and examples are data. As such, all these components can be stored and retrieved efficiently in large quantities, their execution reduces to data comparison and can be done in parallel, and they can be specified, designed, and modified by end users since examples are more intuitive and easy to manipulate than general procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    ISSN: 1573-7497
    Keywords: knowledge representation ; inference ; evidential reasoning ; dynamic binding ; temporal synchrony
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We are capable of drawing a variety of inferences effortlessly, spontaneously, and with remarkable efficiency—as though these inferences are a reflex response of our cognitive apparatus. This remarkable human ability poses a challenge for cognitive science and computational neuroscience: How can a network of slow neuron-like elements represent a large body of systematic knowledge and perform a wide range of inferences with such speed? The connectionist model SHRUTI attempts to address this challenge by demonstrating how a neurally plausible network can encode a large body of semantic and episodic facts, systematic rules, and knowledge about entities and types, and yet perform a wide range of explanatory and predictive inferences within a few hundred milliseconds. Relational structures (frames, schemas) are represented in SHRUTI by clusters of cells, and inference in SHRUTI corresponds to a transient propagation of rhythmic activity over such cell-clusters wherein dynamic bindings are represented by the synchronous firing of appropriate cells. SHRUTI encodes mappings across relational structures using high-efficacy links that enable the propagation of rhythmic activity, and it encodes items in long-term memory as coincidence and coincidence-error detector circuits that become active in response to the occurrence (or non-occurrence) of appropriate coincidences in the on going flux of rhythmic activity. Finally, “understanding” in SHRUTI corresponds to reverberant and coherent activity along closed loops of neural circuitry. Over the past several years, SHRUTI has undergone several enhancements that have augmented its expressiveness and inferential power. This paper describes some of these extensions that enable SHRUTI to (i) deal with negation and inconsistent beliefs, (ii) encode evidential rules and facts, (iii) perform inferences requiring the dynamic instantiation of entities, and (iv) seek coherent explanations of observations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 4 (1994), S. 185-203 
    ISSN: 1573-7497
    Keywords: knowledge representation ; taxonomic reasoning ; object-oriented schemata ; multiple inheritance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract 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 framework is based onterminological logics, which have been developed in the area of artificial intelligence. The framework includes a rigorous formalization of complex objects, which is able to express cyclic references on the schema and instance level; asubsumption algorithm, which computes all impliedspecialization relationships between types; and an algorithm to detectincoherent types, i.e., necessarily empty types. Using results from formal analyses of knowledge representation languages, we show that subsumption and incoherence detection are computationally intractable from a theoretical point of view. However, the problems appear to be feasible in almost all practical cases.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 7 (1997), S. 187-204 
    ISSN: 1573-7497
    Keywords: case-based reasoning ; knowledge representation ; fuzzy logic ; soft computing ; object-orientation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The case-based reasoning (CBR) architecture described in this paper represents a substantive advancement in the representation of case-knowledge. It addresses three major problems found in current CBR schemes: 1) Insufficient treatment of abstract case features' context-dependent characteristics. 2) Lack of a methodical support for atomic and structured case features that contain and represent imprecisely specified quantities. 3) And little account for clustering and organising cognate cases into conceptually overlapping categories. To overcome the representational inadequacy resulting from those deficiencies, this work proposes two modelling fundamentals, namely, fuzzy primitive and fuzzy complex abstract features. These allow a flexible, polymorphic encoding of case characteristics as real numbers, linguistic terms, fuzzy numbers and fuzzy complex objects respectively. Based on this concept, it is possible to systematically organise a case base in fuzzy categories, reflecting real-world case clusters. In the presented scheme, a prototype case and its associated approximation scales form the basis to realise a versatile mechanism to represent the context-specific idiosyncrasies of fuzzy abstract case features. Case categories, fuzzy abstract features, cases, and the approximation scale concept are modelled as self-contained, operational entities. They co-operatively concert their services when they categorise an unclassified problem description (target case), and locate relevant stored cases. Applied to the Coronary Heart Disease risk assessment domain, the proposed architecture has proven to be highly adequate for capturing and efficiently processing case-knowledge. Moreover, as this scheme is designed upon well-established object-oriented principles, it has been shown that it can seamlessly integrate in a wider, more general knowledge management regime.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 7 (1997), S. 227-255 
    ISSN: 1573-7497
    Keywords: knowledge representation ; discourse ; time ; temporal contexts ; conceptual graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A discourse is composed of a sequence of sentences that must be interpreted with respect to the context in which they are uttered and to the actions that produce them: locutors' speech acts. The analysis of discourse content must be based on a pragmatic approach to the study of language in use. Some of the most obvious linguistic elements that require contextual information for their representation are deictic forms such as here, now, I, you, this , and verb tenses. Several authors have recognized a need for introducing contextual structures in knowledge representation models such as semantic networks. Sowa's Conceptual Graph Theory is a powerful approach to conceptually represent knowledge contained in discourses. However, it must be extended in order to represent several semantic and pragmatic mechanisms related to the expression of time in natural language. In this paper we present such an extension as a framework for modeling temporal knowledge in discourses integrating several features borrowed from speech act theory. First, we introduce the notions of time interval, temporal object, temporal situation, and temporal relation. Then, we discuss the importance of explicitly introducing the concept of time coordinate system in a discourse representation and we present different kinds of temporal contexts: narrator's perspective, agent's perspective and temporal localization. We show how this conceptual framework can be used to represent various referential mechanisms in discourse such as anaphoras, indexicals, direct and indirect styles. We also discuss how to model several linguistic phenomena such as speech act characteristics and the specification of performative and attitude utterances. Finally, we briefly discuss how verb tenses can be determined in a discourse on the basis of this temporal approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 9 (1998), S. 163-172 
    ISSN: 1573-7497
    Keywords: Imperfect information ; annotated logic programming ; automated reasoning ; knowledge-based systems ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Imperfect information is a very general term that comprises different types of information, such as uncertain, vague, fuzzy, inconsistent, possibilistic, probabilistic, partially or totally incomplete information [2]. In the literature of knowledge representation we find a different formal model for each one of these distinct types. For example, annotated logic is a formal model to represent inconsistent information. Annotated logics are non-classical logics introduced in [20] as a logic programming theory. They were proved to be paraconsistent. Based on [5], we present in this work the annotated logic programming theory and some of its applications in Artificial Intelligence (AI). We present it as a formalism to reason with inconsistent information and investigate its possibility to represent other types of imperfect information, such as possibilistic and non-monotonic reasoning. Our main goal is to verify and confirm the importance of annotated logics as a tool for developing knowledge-based and automated reasoning systems in AI.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    ISSN: 1573-7551
    Keywords: formalization ; structure ; hypermedia ; argumentation ; design environments ; knowledge-based systems ; groupware ; knowledge representation ; tacit knowledge
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper reflects on experiences designing, developing, and working with users of a variety of interactive computer systems. The authors propose, based on these experiences, that the cause of a number of unexpected difficulties in human-computer interaction lies in users' unwillingness or inability to make structure, content, or procedures explicit. Besides recounting experiences with system use, this paper discusses why users reject or circumvent formalisms which require such explicit expression, and suggests how system designers can anticipate and compensate for problems users have in making implicit aspects of their tasks explicit. The authors propose computational approaches that address this problem, including incremental and system-assisted formalization mechanisms and methods for recognizing and using undeclared structure; they also propose non-computational solutions that involve designers and users reaching a shared understanding of the task situation and the methods that motivate the formalisms. This paper poses that, while it is impossible to remove all formalisms from computing systems, system designers need to match the level of formal expression entailed with the goals and situation of the users -- a design criteria not commonly mentioned in current interface design.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 9 (1980), S. 459-481 
    ISSN: 1573-7640
    Keywords: Ambiguity ; artificial intelligence ; competence theory ; comprehension ; computational linguistics ; database interaction ; knowledge representation ; language use ; linguistic models ; performance theory ; transformational grammar
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A model for language use or performance is given which is essentially independent of the standard theories for language acquisition and competence (the knowledge of language). Comparisons with computer models for language understanding are provided. It is suggested that basic research in human language comprehension must precede construction of new artificial intelligence models.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 1 (1992), S. 57-84 
    ISSN: 1573-7675
    Keywords: causality ; conceptual clustering ; confirmation ; growth of science ; induction ; knowledge representation ; machine learning ; numeric reasoning ; structuring knowledge ; symbolic reasoning ; uncertain reasoning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper analyzes differences between a numeric and symbolic approach to inductive inference. It shows the importance of existing structures in the acquisition of further knowledge, including statistical confirmation. We present a new way of looking at Hempel's paradox, in which both existing structures and statistical confirmation play a role in order to decrease the harm it does to learning. We point out some of the most important structures, and we illustrate how uncertainty does blur but does not destroy these structures. We conclude that pure symbolic as well as pure statistical learning is not realistic, but the integration of the two points of view is the key to future progress, but it is far from trivial. Our system KBG is a first-order logic conceptual clustering system; thus it builds knowledge structures out of unrelated examples. We describe the choices done in KBG in order to build these structures, using both numeric and symbolic types of knowledge. Our argument gives us firm grounds to contradict Carnap's view that induction is nothing but uncertain deduction, and to propose a refinement to Popper's “purely deductive” view of the growth of science. In our view, progressive organization of knowledge plays an essential role in the growth of new (inductive) scientific theories, that will be confirmed later, quite in the Popperian way.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 13 (1999), S. 155-194 
    ISSN: 1573-7675
    Keywords: knowledge bases ; knowledge base management systems ; knowledge representation ; storage management ; concurrency control ; application programming interface (API)
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Collaborative knowledge base (KB) authoring environments are critical for the construction of high-performance KBs. Such environments must support rapid construction of KBs by a collaborative effort of teams of knowledge engineers through reuse of existing knowledge and software components. They should support the manipulation of knowledge by diverse problem-solving engines even if that knowledge is encoded in different languages and by different researchers. They should support large KBs and provide a scalable and interoperable development infrastructure. In this paper, we present an environment that satisfies many of these goals. We present an architecture for scalable frame representation systems (FRSs). The Generic Frame Protocol (GFP) provides infrastructure for reuse of software components. It is a procedural interface to frame representation systems that provides a common means of accessing and modifying frame KBs. The Generic KB Editor (GKB-EDITOR) provides graphical KB browsing, editing, and comprehension services for large KBs. Scalability of loading and saving time is provided by a storage system (PERK) which submerges a database management system in an FRS. Multi-user access is controlled through a collaboration subsystem that uses a novel optimistic concurrency control algorithm. All the results have been implemented and tested in the development of several real KBs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 6 (1996), S. 5-31 
    ISSN: 1573-7675
    Keywords: set theory ; knowledge representation ; information management ; commonsense reasoning ; nonwell-founded sets (hypersets)
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The merits of set theory as a foundational tool in mathematics stimulate its use in various areas of artificial intelligence, in particular intelligent information systems. In this paper, a study of various nonstandard treatments of set theory from this perspective is offered. Applications of these alternative set theories to information or knowledge management are surveyed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 13 (1999), S. 195-234 
    ISSN: 1573-7675
    Keywords: data mining ; knowledge discovery ; machine learning ; knowledge representation ; attribute-oriented generalization ; domain generalization graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Attribute-oriented generalization summarizes the information in a relational database by repeatedly replacing specific attribute values with more general concepts according to user-defined concept hierarchies. We introduce domain generalization graphs for controlling the generalization of a set of attributes and show how they are constructed. We then present serial and parallel versions of the Multi-Attribute Generalization algorithm for traversing the generalization state space described by joining the domain generalization graphs for multiple attributes. Based upon a generate-and-test approach, the algorithm generates all possible summaries consistent with the domain generalization graphs. Our experimental results show that significant speedups are possible by partitioning path combinations from the DGGs across multiple processors. We also rank the interestingness of the resulting summaries using measures based upon variance and relative entropy. Our experimental results also show that these measures provide an effective basis for analyzing summary data generated from relational databases. Variance appears more useful because it tends to rank the less complex summaries (i.e., those with few attributes and/or tuples) as more interesting.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent information systems 9 (1997), S. 181-202 
    ISSN: 1573-7675
    Keywords: Relational database ; probabilistic reasoning ; knowledge representation ; generalized acyclic join dependency ; belief networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Probabilistic methods provide a formalism for reasoning aboutpartial beliefs under conditions of uncertainty. This paper suggests a newrepresentation of probabilistic knowledge. This representation encompassesthe traditional relational database model. In particular, it is shown thatprobabilistic conditional independence is equivalent to the notion of generalized multivalued dependency. More importantly,a Markov network can be viewed as a generalized acyclic joindependency. This linkage between these two apparently different butclosely related knowledge representations provides a foundation fordeveloping a unified model for probabilistic reasoning and relationaldatabase systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Journal of systems integration 4 (1994), S. 219-241 
    ISSN: 1573-8787
    Keywords: Single agent planning ; knowledge representation ; ontology ; formalization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Planning is perhaps the single most important activity in any domain, be it a business enterprise, academics or personal life. However most efforts in a Artificial Intelligence to provideintelligent planners have met with a very limited success. Successful, non-trivial applications are limited to very domain and situation specific cases. A generic component which can serve as a schema or template from which planning aids to any specific domain can be instantiated would be very much useful in building specific planning applications. A formal method for characterizing the needed capabilities of a generic component is required. In this paper we present such a method and illustrate its use through analysis of simple agent planiing situations. The result of this analysis is presented in the form of an ontology, and a formal languags with an associated model theoretic semantics. The results presented can be used as a framework for benchmarking to compare and discriminate between the knowledge/information representation capabilites of different software systems. The results also serve as a model for formalizing the description of a particular class of engineering, business or manufacturing planning activities. The focus of this paper is on thekowledge andinformation that must berepresented rather than onplan generation strategies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Real-time systems 15 (1998), S. 221-247 
    ISSN: 1573-1383
    Keywords: time-bounded reasoning ; cache ; knowledge representation ; planning ; shortwave communication
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Knowledge-based computing, in general, suffers from an inherent open-endedness that precludes its application in time-bounded domains where an answer must be computed within a stipulated time limit. We examine a two-way improvement of the shortcomings: a knowledge representation scheme that provides easy access to relevant knowledge and thereby reduces search time, and a reasoning scheme that is algorithmic in nature and thus makes computational requirements meaningfully estimable. In this work, we offer a cache-based architecture that is capable of both storing knowledge in different formats (e.g. rules, cases), and invoking an appropriate reasoning scheme to fit the available computing time. The cache helps in retrieving the most relevant pieces of knowledge (not only exact matches) required for solving a given problem. This cache relies on a reasoning tactic, knowledge interpolation, that can generate a solution from two near-matches in an algorithmic way, to generate time-bounded solutions. We illustrate the design of such a cache for solving resource allocation problems in the domain of shortwave radio transmission and evaluate its performance in observing imposed temporal bounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 10 (1993), S. 59-78 
    ISSN: 1573-0670
    Keywords: Fuzzy logic ; fuzzy resolution ; knowledge representation ; uncertainty reasoning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract There have been only few attempts to extend fuzzy logic to automated theorem proving. In particular, the applicability of the resolution principle to fuzzy logic has been little examined. The approaches that have been suggested in the literature, however, have made some semantic assumptions which resulted in limitations and inflexibilities of the inference mechanism. In this paper we present a new approach to fuzzy logic and reasoning under uncertainty using the resolution principle based on a new operator, the fuzzy operator. We present the fuzzy resolution principle for this logic and show its completeness as an inference rule.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 13 (1994), S. 69-82 
    ISSN: 1573-0670
    Keywords: nonmonotonic reasoning ; autoepistemic logic ; default logic and logic programming ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We study the expressive power of first-order autoepistemic logic. We argue that full introspection of rational agents should be carried out by minimizing positive introspection and maximizing negative introspection. Based on full introspection, we propose the maximal well-founded semantics that characterizes autoepistemic reasoning processes of rational agents, and show that breadth of the semantics covers all theories in autoepistemic logic of first order, Moore's AE logic, and Reiter's default logic. Our study demonstrates that the autoepistemic logic of first order is a very powerful framework for nonmonotonic reasoning, logic programming, deductive databases, and knowledge representation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 14 (1995), S. 237-255 
    ISSN: 1573-0670
    Keywords: intensional logic ; knowledge representation ; property theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract For a number of tasks in knowledge representation, and particularly in natural language semantics, it is useful to be able to treat propositions and properties as objects — as items that can appear as arguments of predicates, as things one can quantify over, and so on. Logics that support such “intensional” operations are notoriously hard to work with. The current paper presents a theorem prover for one such logic, namely, Turner's property theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 20 (1998), S. 167-190 
    ISSN: 1573-0670
    Keywords: automated reasoning ; knowledge representation ; informational logic ; probabilistic reasoning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A logical entropy-based Informational Logic is presented which provides new tools for probabilistic automated reasoning and knowledge representation. Applications in automated theorem proving are examined, and a decision theory for probabilistic theorems is proposed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 3 (1987), S. 113-200 
    ISSN: 1573-0670
    Keywords: Sorts ; polymorphism ; control ; search space ; logic ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Many sorted logics can increase deductive efficiency by eliminating useless branches of the search space, but usually this results in reduced expressiveness. The many sorted logic described here has several unusual features which not only increase expressiveness but also can reduce the search space even more than a conventional many sorted logic. The quantifiers are unsorted: the restriction on the range of a variable derives from the argument positions of the nonlogical symbols that it occupies. Polymorphic sort specifications are allowed; thus statements usually requiring several assertions may be compactly expressed by a single assertion. The sort structure may be an arbitrary lattice and the sort of a term can be more general than the sort of the argument position it occupies. It is also shown how it is sometimes possible to use sort information to determine the truth value of a formula without resort normal inference. Inference rules for a resolution based system are discussed; these can be proved to be sound and complete.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 3 (1987), S. 329-338 
    ISSN: 1573-0670
    Keywords: Indexicals ; knowledge representation ; first-order logic ; situated logic ; utterances
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We study the Knights and Knaves problem, and find that for a proper treatment via theorem-proving, an interaction with natural language processing research is helpful. In particular, we discuss Ohlbach's claim that first-order logic is not well suited to handling this problem. Then we provide an interpretation of the problem using indexicals, axiomatize it, and prove the desired result. We conclude by suggesting a broader context for dealing with ‘self-utterances’ in automatic theorem-proving.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    ISSN: 1573-0670
    Keywords: AI ; automated: reasoning/programming/theorem proving ; computational logic ; error correction ; induction, inference rules ; intelligent robot ; knowledge representation ; knowledge-based software ; logic programming ; multisensor integration and fusion ; object-oriented reasoning ; predicate calculus, program: synthesis/verification ; robotics, strategy ; verification, very high level languages
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article provides an overview of automated reasoning and of the various fields for which it is relevant. It takes the form of a collection of articles, each covering some field and each written by an expert in that field. A field is introduced, its elements reviewed, the current state of the art given, the basic problems discussed, and the various goals listed. Although individually the goals of each field present a wide spectrum, collectively the fields share the interest of automating the process known as reasoning.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 2 (1986), S. 329-390 
    ISSN: 1573-0670
    Keywords: Automated reasoning ; logic programming ; theorem proving ; knowledge representation ; heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper describes automated reasoning in a PROLOG Euclidean geometry theorem-prover. It brings into focus general topics in automated reasoning and the ability of Prolog in coping with them.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 15 (1995), S. 41-68 
    ISSN: 1573-0670
    Keywords: terminological default logic ; default theories with priorities ; knowledge representation ; 68T30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In a recent paper we have proposed terminological default logic as a formalism that combines means both for structured representation of classes and objects and for default inheritance of properties. The major drawback that terminological default logic inherits from general default logic is that it does not take precedence of more specific defaults over more general ones into account. This behavior has already been criticized in the general context of default logic, but it is all the more problematic in the terminological case where the emphasis lies on the hierarchical organization of concepts. The present paper addresses the problem of modifying terminological default logic such that more specific defaults are preferred. We assume that the specificity ordering is induced by the hierarchical organization of concepts, which means that default information is not taken into account when computing priorities. It turns out that the existing approaches for expressing priorities between defaults do not seem to be appropriate for defaults with prerequisites. Therefore we shall consider an alternative approach for dealing with prioritization in the framework of Reiter's default logic. The formalism is presented in the general setting of default logic where priorities are given by an arbitrary partial ordering on the defaults. We shall exhibit some interesting properties of the new formalism, compare it with existing approaches, and describe an algorithm for computing extensions. In the terminological case, we thus obtain an automated default reasoning procedure that takes specificity into account.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 14 (1995), S. 149-180 
    ISSN: 1573-0670
    Keywords: knowledge representation ; terminological reasoning ; nonmonotonic reasoning ; default logic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforward than we expected, considering the fact that the terminological language is a decidable sublanguage of first-order logic. Semantically, one has the unpleasant effect that the consequences of a terminological default theory may be rather unintuitive, and may even vary with the syntactic structure of equivalent concept expressions. This is due to the unsatisfactory treatment of open defaults via Skolemization in Reiter's semantics. On the algorithmic side, we show that this treatment may lead to an undecidable default consequence relation, even though our base language is decidable, and we have only finitely many (open) defaults. Because of these problems, we then consider a restricted semantics for open defaults in our terminological default theories: default rules are applied only to individuals that are explicitly present in the knowledge base. In this semantics it is possible to compute all extensions of a finite terminological default theory, which means that this type of default reasoning is decidable. We describe an algorithm for computing extensions and show how the inference procedures of terminological systems can be modified to give optimal support to this algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 20 (1998), S. 191-213 
    ISSN: 1573-0670
    Keywords: paraconsistent reasoning ; inconsistent information ; knowledge representation ; semantics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations. Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Journal of logic, language and information 1 (1992), S. 131-140 
    ISSN: 1572-9583
    Keywords: nonmonotonic logic ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Notes: Abstract The purpose of this note is to make quite clear the relationship between two variants of the general notion of a preferential model for nonmonotonic inference: the models of Kraus, Lehmann and Magidor (KLM models) and those of Makinson (MAK models). On the one hand, we introduce the notion of the core of a KLM model, which suffices to fully determine the associated nonmonotonic inference relation. On the other hand, we slightly amplify MAK models with a monotonic consequence operation as additional ingredient. We give two equivalent characterizations of the cores of KLM models: they are precisely the amplified MAK models whose satisfaction relation: may be expressed as the intersection of some non-empty family of satisfaction relations each of which is classically well-behaved; or satisfies certain syntactic conditions. This gives corollary characterizations of certain particular classes of KLM models, notably those that are (in their terminology) cumulative and more specifically those they call preferential.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Journal of logic, language and information 4 (1995), S. 227-250 
    ISSN: 1572-9583
    Keywords: Peirce algebras ; modal logic ; algebraic logic ; relation algebras ; logics of programs ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Notes: Abstract Peirce algebras combine sets, relations and various operations linking the two in a unifying setting. This paper offers a modal perspective on Peirce algebras. Using modal logic a characterization of the full Peirce algebras is given, as well as a finite axiomatization of their equational theory that uses so-called unorthodox derivation rules. In addition, the expressive power of Peirce algebras is analyzed through their connection with first-order logic, and the fragment of first-order logic corresponding to Peirce algebras is described in terms of bisimulations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Journal of logic, language and information 6 (1997), S. 33-61 
    ISSN: 1572-9583
    Keywords: Rational agents ; belief revision ; reasoning about action ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Notes: Abstract In this paper a formal framework is proposed in which variousinformative actions are combined, corresponding to the different ways in whichrational agents can acquire information. In order to solve the variousconflicts that could possibly occur when acquiring information fromdifferent sources, we propose a classification of the informationthat an agent possesses according to credibility. Based on this classification, we formalize what itmeans for agents to have seen or heard something, or to believesomething by default. We present a formalization of observations,communication actions, and the attempted jumps to conclusions thatconstitutes default reasoning. To implement these informative actionswe use a general belief revision action which satisfies theAGM postulates; dependent on the credibility of the incominginformation this revision action acts on one or more parts ofthe classified belief sets of the agents. The abilities of agents formalizeboth the limited capacities of agents to acquire information, and the preference of one kind of information acquisition to another. A very important feature of our approach is that it shows how to integratevarious aspects of agency, in particular the (informational) attitudesof dealing with information from observation, communication and defaultreasoning into one coherent framework, both model-theoretically andsyntactically.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    User modeling and user adapted interaction 5 (1995), S. 67-86 
    ISSN: 1573-1391
    Keywords: Adaptive ; planning ; planning recognition ; simulation ; multi-agent ; multimedia ; tutoring ; artificial intelligence ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An intelligent tutoring system customizes its presentation of knowledge to the individual needs of each student based on a model of the student. Student models are more complex than other user models because the student is likely to have misconceptions. We have addressed several difficult issues in reasoning about a student's knowledge and skills within a real-time simulation-based training system. Our conceptual framework enables important aspects of the tutor's reasoning to be based upon simple, comprehensible representations that are the basis for a Student Centered Curriculum. We have built a system for teaching cardiac resuscitation techniques in which the decisions abouthow to teach are separated from the decisions aboutwhat to teach. The training context (i.e., choice of topics) is changed based on a tight interaction between student modeling techniques and simulation management. Although complex student models are still required to support detailed reasoning about how to teach, we argue that the decision about what to teach can be adequately supported by qualitatively simpler techniques, such as overlay models. This system was evaluated in formative studies involving medical school faculty and students. Construction of the student model involves monitoring student actions during a simulation and evaluating these actions in comparison with an expert model encoded as a multi-agent plan. The plan recognition techniques used in this system are novel and allow the expert knowledge to be expressed in a form that is natural for domain experts.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    User modeling and user adapted interaction 2 (1992), S. 211-248 
    ISSN: 1573-1391
    Keywords: Text generation ; Intelligent help ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Help for users of Information Processing Systems (IPSs) is typically based upon the presentation of pre-stored texts written by the system designers for predictable situations. Though advances in user interface technology have eased the process of requesting advice, current on-line help facilities remain tied to a back-end of canned answers, spooled onto users, screens to describe queried facilities. This paper argues that the combination of a user's knowledge of an application and the particular states which a system can assume require different answers for the large number of possible situations. Thus, a marriage of techniques from the fields of text generation and Intelligent Help Systems research is needed to construct responses dynamically. Furthermore, it is claimed that the help texts should attempt to address not only the immediate needs of the user, but to facilitate learning of the system by incorporating a variety of educational techniques to specialise answers in given contexts. A computational scheme for help text generation based on schema of rhetorical predicates is presented. Using knowledge of applications programs and their users, it is possible to provide a variety of answers in response to a number of questions. The approach uses object-oriented techniques to combine different information from a variety of sources in a flexible manner, yielding responses which are appropriate to the state of the IPS and to the user's level of knowledge. Modifications to the scheme which resulted from its evaluation in the EUROHELP project are described, together with ongoing collaborative work and further research developments.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    User modeling and user adapted interaction 3 (1993), S. 107-153 
    ISSN: 1573-1391
    Keywords: information processing ; learning ; knowledge representation ; CAI ; ICAI ; AI
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In the present work, the semantics of the Extended Genetic Graph (EGG) is defined in order to eliminate limitations inherent in these graphs in the modelling of an ideal Student Model. The semantics of extended genetic graphs can be defined at two representational levels: conceptual and transactional. First, the student's knowledge as represented by EGG nodes is specified explicitly at the conceptual level using the conceptual graphs (CGs) as a representation. Secondly, the criteria for the definition and use of learning processes such asanalogy, generalization, refinement, component, anddeviation/correction are specified at the transactional level. These criteria are then associated with the conditions of existence of different EGG links as they are implicitly assumed in the semantics of these graphs. Once the conditions of their creation are known, the semantics of EGG links can be represented explicitly by the use of CGs and Predicate Transition Networks (PrTNs). These representations are then used for detecting different types of EGG links. Conceptual graphs combined with PrTNs are able to describe the semantic structures equivalent to those contained implicitly in EGGs. However, the semantics of the combined graph which is based on the results of cognitive psychology, natural language processing, as well as logic, are richer than the semantics of the EGG. Furthermore, the operations provided by the conceptual graph theory combined with the constraint specifications as expressed by PrTNs allow the modification of the learner graph. Thus, our proposed representational framework provides the basis for the construction of a deep dynamical student model. An example from the Boolean Algebra domain demonstrates its feasibility.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    User modeling and user adapted interaction 4 (1994), S. 21-45 
    ISSN: 1573-1391
    Keywords: User modelling ; CAI ; intelligent tutoring systems ; hypertext ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article is a comparative description of the user modelling component of ANATOM-TUTOR, an intelligent anatomy tutoring system for use at university level. We introduce ITSs in general, discussing some of the psychological and pedagogical issues involved in using computers in education, and ANATOM-TUTOR in particular, and locate ANATOM-TUTOR's user modelling component in the field of existing user models. Details of the user model's construction and maintenance, the knowledge representation techniques used in it, and its relation to the domain knowledge base are then discussed. Two applications of ANATOM-TUTOR's user model are described: (1) tailoring hypertext to the level of knowledge of the individual user; and (2) generating explanations and questions in a simulated examination situation, also taking into consideration the individual user's level of knowledge.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 11 (1997), S. 453-482 
    ISSN: 1573-7462
    Keywords: spreading activation ; information storage and retrieval ; semantic networks ; associative information retrieval ; information processing ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper surveys the use of Spreading Activation techniques onSemantic Networks in Associative Information Retrieval. The majorSpreading Activation models are presented and their applications toIR is surveyed. A number of works in this area are criticallyanalyzed in order to study the relevance of Spreading Activation forassociative IR.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    ISSN: 1573-7497
    Keywords: software reuse ; expert systems ; knowledge representation ; domain modeling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Software reuse is widely believed to be a key to improving software productivity and quality in conventional software. In expert systems, much of the knowledge has been compiled (i.e., compressed and restricted into effective procedures) and this makes reusability difficult. One of the issues in modeling expert systems for enhanced reusability is capturing explicity the underlying problem solving designs. Principled knowledge representation schemes have been used to model components of complex software systems. However, the potential for applying these principled modeling techniques for explicitly capturing the problem solving designs of expert systems has not been fully explored. To overcome this omission, we use an Artificial Intelligence knowledge representation scheme for developing an ontology of the software components to facilitate their classification and retrieval. The application of our ontological approach is of both theoretical and practical significance. This method facilitates the reuse of high-level design. We illustrate the application of principled domain modeling using two real world applications of knowledge-based systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 5 (1998), S. 63-77 
    ISSN: 1573-7527
    Keywords: vision ; active perception ; reasoning ; knowledge representation ; agent architectures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation maps naturally into feed-forward parallel networks or can be implemented on stock hardware using bit-mask instructions. The representation has “circuit-semantics” (Nilsson, 1994, Rosenschein and Kaelbling, 1986), but can efficiently represent propositions containing modals, unary predicates, and functions. We describe an example using Kludge, a vision-based mobile robot programmed to perform simple natural language instructions involving fetching and following tasks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Automated software engineering 4 (1997), S. 291-317 
    ISSN: 1573-7535
    Keywords: knowledge representation ; software knowledge bases ; languages
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We argue that one important role that Artificial Intelligence can play in Software Engineering is to act as a source of ideas about representing knowledge that can improve the state-of-the-art in software information management, rather than just building intelligent computer assistants. Among others, such techniques can lead to new approaches for capturing, recording, organizing, and retrieving knowledge about a software system. Moreover, this knowledge can be stored in a software knowledge base, which serves as “corporate memory”, facilitating the work of developers, maintainers and users alike. We pursue this central theme by focusing on requirements engineering knowledge, illustrating it with ideas originally reported in (Greenspan et al., 1982; Borgida et al., 1993; Yu, 1993) and (Chung, 1993b). The first example concerns the language RML, designed on a foundation of ideas from frame- and logic-based knowledge representation schemes, to offer a novel (at least for its time) formal requirements modeling language. The second contribution adapts solutions of the frame problem originally proposed in the context of AI planning in order to offer a better formulation of the notion of state change caused by an activity, which appears in most formal requirements modeling languages. The final contribution imports ideas from multi-agent planning systems to propose a novel ontology for capturing organizational intentions in requirements modeling. In each case we examine alterations that have been made to knowledge representation ideas in order to adapt them for Software Engineering use.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 2 (1990), S. 245-259 
    ISSN: 1573-7470
    Keywords: Statistics ; artificial intelligence ; database ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Statistical databases have traditionally been stored as flat files approximating relations. We propose that by storing statistical data in an object oriented type database, enhanced with knowledge of statistical theory, a more natural and powerful interface to statistical data can be created. A formalism is proposed for dealing with and combining data that have random components by makingstatistics first class citizens in the database world. Entities in the databases are classified according to whether they areobservations, orstatistics.Estimates are a special type ofstatistics which aremoored toobservation entities.Statistics entities are classified by their statistical properties. A hierarchical structure of random features is provided, with distributions at its leaves. This structure is a DAG (Directed Acyclic Graph), which may be extended or redefined for different applications and contains information used to compare and manipulatestatistics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 30 (2000), S. 119-169 
    ISSN: 1573-7470
    Keywords: planning ; temporal logics ; action and change ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present TALplanner, a forward-chaining planner based on the use of domain-dependent search control knowledge represented as formulas in the Temporal Action Logic (TAL). TAL is a narrative based linear metric time logic used for reasoning about action and change in incompletely specified dynamic environments. TAL is used as the formal semantic basis for TALplanner, where a TAL goal narrative with control formulas is input to TALplanner which then generates a TAL narrative that entails the goal and control formulas. The sequential version of TALplanner is presented. The expressivity of plan operators is then extended to deal with an interesting class of resource types. An algorithm for generating concurrent plans, where operators have varying durations and internal state, is also presented. All versions of TALplanner have been implemented. The potential of these techniques is demonstrated by applying TALplanner to a number of standard planning benchmarks in the literature.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...