ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (17)
  • Blackwell Publishers Inc.  (17)
  • 1995-1999  (17)
  • 1940-1944
  • Informatik  (17)
Sammlung
  • Artikel  (17)
Datenquelle
Verlag/Herausgeber
Erscheinungszeitraum
Jahr
Thema
  • 1
    Digitale Medien
    Digitale Medien
    Representing and Reasoning about Motion in a Two-Dimensional World (1998)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: We present a point-based spatiotemporal first-order logic for representing the qualitative and quantitative spatial temporal knowledge needed to reason about motion in a two-dimensional space. A feature of the logic is the uniform treatment of space and time. The knowledge of a simplified world, a two-dimensional street network with active traffic lights, is represented, and the reasoning problem of how a robot moves from one place to another in the world is formalized with the proposed logic.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00061
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    Extending Conceptual Definitions with Default Knowledge (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: In description logics, default knowledge is exclusively treated as incidental rules. However, as few concepts are definable using only strict knowledge, imposing strict definitions leads to terminological knowledge bases that mostly contain partially defined concepts. This is a real problem because such concepts can only be inserted as leaves of the terminology. Moreover, instance recognition is biased as these concepts must be explicitly mentioned as properties of these instances. It follows that partially defined concepts are described with necessary but not sufficient conditions. As a solution to these problems, we propose to integrate defaults in concept definitions and we argue that this is essential for our diagnosis application. We introduce a description language ALεδ with default(δ) and exception(ε) connectives. The cornerstone of our approach is the introduction of a definitional point of view where a default can be part of a concept definition, whereas in the classical inheritance one it is only viewed as a weak implication. We go on to describe a map between the definition of a concept and its inherited properties, and we show that the combination of these definitional and inheritance levels considerably improves the capabilities of classification processes. In particular this allows us to distinguish sure from probable instances and typical from exceptional instances. Finally we provide a specific operation, object refinement, which consists in enlarging object descriptions with exceptions in order to find additional concepts the object is an instance of. This operation is useful for our diagnosis application.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00040
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    Abstractional Concept Mapping: A Foundational Model for Analogical Reasoning (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: We present a mathematical model providing a formal basis for analogical reasoning, referred to as abstractional concept mapping. The approach provides a formal basis for all comparison–based reasoning (e.g., literal similarity, analogy, metaphor, and scientific models) in that given any two descriptions in first–order logic, arbitrary comparisons of similarity are representable as first–order theories (referred to as “comparison theories”), dependent only on the notion of logical truth and not on domain–specific heuristics or particular features of the knowledge representation.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00028
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 4
    Digitale Medien
    Digitale Medien
    A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only Knowing (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Fifteen years of work on nonmonotonic logic has certainly increased our understanding of the area. However, given a problem in which nonmonotonic reasoning is called for, it is far from clear how one should go about modeling the problem using the various approaches. We explore this issue in the context on two of the best–known approaches, Reiter's default logic and Moore's autoepistemic logic, as well as two related notions of “only knowing,” due to Halpern and Moses and to Levesque. In particular, we return to the original technical definitions given in these papers and examine the extent to which they capture the intuitions they were designed to capture.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00036
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 5
    Digitale Medien
    Digitale Medien
    A Many-Sorted Natural Deduction (1998)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: The goal of this paper is to motivate and define yet another sorted logic, called SND. All the previous sorted logics that can be found in the Artificial Intelligence literature have been designed to be used in (completely) automated deduction. SND has been designed to be used in interactive theorem proving. Because of this shift of focus, SND has been designed to satisfy three innovative design requirements: it is defined on top of a natural deduction calculus, and in a way to be a definitional extension of such calculus; and it is implemented on top of its implementation. In turn, because of this fact, SND has various innovative technical properties; among them: it allows us to deal with free variables, it has no notion of well-sortedness and of well-sortedness being a prerequisite of well-formedness, its implementation is such that, in the default mode, the system behaves exactly as with the original unsorted calculus.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00058
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 6
    Digitale Medien
    Digitale Medien
    An Informal Semantic Analysis of Motion Verbs Based on Physical Primitives (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: A representation scheme for verbs and prepositions specifying path and locative information is developed. The representation emphasizes the implementability of the underlying semantic primitives. The primitives pertain to mechanical characteristics such as geometric relationships among objects, force or motion characteristics implied by verbs, and their prepositional modifiers. This representation has been used to animate the performance of tasks underlying natural language imperatives.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00034
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 7
    Digitale Medien
    Digitale Medien
    Reasoning about Locations in Theory and Practice (1998)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Locational reasoning plays an important role in many applications of AI problem-solving systems, yet has remained a relatively unexplored area of research. This paper addresses both theoretical and practical issues relevant to reasoning about locations. We define several theories of location designed for use in various settings, along with a sound and complete belief revision calculus for each that maintains a STRIPS-style database of locational facts. Techniques for the efficient operationalization of the belief revision rules in planning frameworks are presented. These techniques were developed during application of the location theories to several large-scale planning tasks within the Sipe planning framework.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00059
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 8
    Digitale Medien
    Digitale Medien
    Process and Policy: Resource-Bounded NonDemonstrative Reasoning (1998)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This paper investigates the appropriateness of formal dialectics as a basis for nonmonotonic reasoning and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protocols are appropriate for such deliberations when resources are bounded and search is serial.AI, it is claimed here, is now perfectly positioned to correct many misconceptions about reasoning that have resulted from mathematical logic's enormous success in this century: among them, (1) that all reasons are demonstrative, (2) that rational belief is constrained, not constructed, and (3) that process and disputation are not essential to reasoning. AI mainly provides new impetus to formalize the alternative (but older) conception of reasoning, and AI provides mechanisms with which to create compelling formalism that describes the control of processes.The technical contributions here are: the partial justification of dialectic based on controlling search; the observation that nonmonotonic reasoning can be subsumed under certain kinds of dialectics; the portrayal of inference in knowledge bases as policy reasoning; the review of logics of dialogue and proposed extensions; and the preformal and initial formal discussion of aspects and variations of dialectical systems with nondemonstrative reasons.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00055
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 9
    Digitale Medien
    Digitale Medien
    Integrating Discrete and Continuous Change in a Logical Framework (1998)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: The goal of our work is to develop theoretical foundations for the representation of knowledge in domains in which properties may vary continuously. One achievement of our research is that it extends the applicability of current research on theories of action. Furthermore, we are able to apply known approaches to the frame and ramification problems, developed for discretely changing worlds, to domains in which the world changes continuously.Our approach is based on the discrete situation calculus and on a monotonic solution to the frame problem. In order to address the combined frame and ramification problems, we extend Lin and Reiter's work. We use Pinto and Reiter's extension to the situation calculus to represent occurrences. We extend this work further to allow for reasoning by default. For example, if we know that a ball is falling and we do not have any reason to believe that an action would interfere with the ball's motion, then we assume that the ball will hit the ground. Finally, we extend the language of the situation calculus to allow for properties that change within situations. We also show that our proposed situation calculus inherits the solutions to the frame and ramification problems.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00056
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 10
    Digitale Medien
    Digitale Medien
    A Formal Model for Experience–Aided Diagnosis (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This paper presents a novel approach to model–based diagnosis. The approach addresses the two main problems that have prevented model–based diagnostic techniques from being widely used: computational complexity of abduction and inadequacies of device models. A model for automated diagnosis is defined that combines (1) deduction to rule out hypotheses, (2) abduction to generate hypotheses, and (3) induction to recall past experiences and account for potential errors in the device models. A review of the three forms of inference is provided, as well as a detailed analysis of the relationship between case–based reasoning and induction. The proposed model for diagnosis is used to characterize diagnostic errors and relate them to different types of errors in the device models. Experimental results are then described and used to assert the practicality and the usefulness of the approach. The model presented in this paper yields a practical method for solving hard diagnostic problems at a reasonable computational cost and provides a theoretical basis for overcoming the problem of partially incorrect device models.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00038
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 11
    Digitale Medien
    Digitale Medien
    Combinatorial Semantics: Semantics for Frequent Validity (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: In ordinary first–order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accommodate inductive/uncertain/probabilistic/nonmonotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the relevant premises are true. More generally, we say that an inference is [p,q] valid if its conclusion is true in a proportion lying between p and q of those models in which the relevant premises are true. If we include a statistical variable binding operator “%” in our language, there are many quite general (and useful) things we can say about uncertain validity. A surprising result is that some of these things may conflict with Bayesian conditionalization.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00039
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 12
    Digitale Medien
    Digitale Medien
    Determining Prepositional Attachment, Prepositional Meaning, Verb Meaning, and Thematic Roles (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: An algorithm for semantic interpretation that integrates the determination of the meaning of verbs, the attachment and meaning of prepositions, and the determination of thematic roles is presented. The parser does not resolve structural ambiguity, which is solely the task of the semantic interpreter. Lexical semantic information about nouns and verbs is applied to the resolution of verb polysemy and modifier attachment. Semantic interpretation is centered on the representation of the meaning of the verb, called verbal concept. Verbal concepts are organized into a classification hierarchy. As long as the meaning of the verb remains unknown, parsing proceeds on a syntactic basis. Once the meaning of the verb is recognized, the semantic component makes sense of the syntactic relations built so far by the parser and of those still to be parsed. The algorithm has been implemented and tested on real–world texts.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00032
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 13
    Digitale Medien
    Digitale Medien
    What Should Default Reasoning be, by Default? (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This is a position paper concerning the role of empirical studies of human default reasoning in the formalization of AI theories of default reasoning. We note that AI motivates its theoretical enterprise by reference to human skill at default reasoning, but that the actual research does not make any use of this sort of information and instead relies on intuitions of individual investigators. We discuss two reasons theorists might not consider human performance relevant to formalizing default reasoning: (a) that intuitions are sufficient to describe a model, and (b) that human performance in this arena is irrelevant to a competence model of the phenomenon. We provide arguments against both these reasons. We then bring forward three further considerations against the use of intuitions in this arena: (a) it leads to an unawareness of predicate ambiguity, (b) it presumes an understanding of ordinary language statements of typicality, and (c) it is similar to discredited views in other fields. We advocate empirical investigation of the range of human phenomena that intuitively embody default reasoning. Gathering such information would provide data with which to generate formal default theories and against which to test the claims of proposed theories. Our position is that such data are the very phenomena that default theories are supposed to explain.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00037
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 14
    Digitale Medien
    Digitale Medien
    Discounted Reinforcement Learning Does Not Scale (1997)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 13 (1997), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Currently popular reinforcement learning methods are based on estimating value functions that indicate the long–term value of each problem state. In many domains, such as those traditionally studied in AI planning research, the size of state spaces precludes the individual storage of state value estimates. Consequently, most practical implementations of reinforcement learning methods have stored value functions using generalizing function approximators, with mixed results. We analyze the effects of approximation error on the performance of goal–based tasks, revealing potentially severe scaling difficulties. Empirical evidence is presented that suggests when difficulties are likely to occur and explains some of the widely differing results reported in the literature.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00035
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 15
    Digitale Medien
    Digitale Medien
    Using Diagrams to Understand Geometry (1998)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This paper describes ARCHIMEDES-STUDENT, a computer program that constructs and modifies its own representations of diagrams from instructions supplied by a human who is demonstrating a theorem of geometry. The program's representation permits it to make inferences from its constructions and to find a justification for the conclusion of the theorem. It is argued that the sort of perceptual reasoning displayed by this program represents one important aspect of understanding because it relates the abstract mathematical theorem to knowledge of spatial relations. For humans this approach grounds abstraction in experience and thus provides a more compelling demonstration than a formal proof. Because ARCHIMEDES-STUDENT is a well-defined computer program, it provides a precise suggestion of how this aspect of understanding can be achieved.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00062
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 16
    Digitale Medien
    Digitale Medien
    Depth-First Branch-and-Bound versus Depth-Bounded IDA: New Results (1998)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: In a real-time task an action must be executed given limited computation. One approach to limited computation is to search a tree of possible action sequences to a fixed depth and then execute an action with the lowest associated backed-up cost. The standard algorithm for such a search is Depth-First Branch-and-Bound (DFBB), also known in the Artificial Intelligence literature as Minimin with Alpha Pruning. This article shows that a depth-bounded extension of a popular iterative algorithm called IDA has a surprisingly large range of search trees on which it outperforms DFBB—something previous analytical results do not predict. We prove that the extended algorithm, which we call DIDA, is correct, is guaranteed to terminate, and is asymptotically (i.e., on its last iteration) as efficient as DFBB—assuming a consistent heuristic is used. We also prove that both algorithms are guaranteed not to decrease their accuracy with a deeper search, assuming a consistent heuristic. Because accuracy is generally correlated with decision quality, the time saved by visiting fewer states translates to deeper searches which translates to better decisions. Results from random search trees show that DIDA is most efficient when the path cost + leaf node heuristic value is distributed with low variance; as branching factor increases, the range for which DIDA is more efficient also increases. Results with Eight, Fifteen, Twenty-four, and Ninety-nine Puzzle implementations of both algorithms—all domains with low variance of path cost + leaf node heuristic value—show that DIDA significantly outperforms DFBB.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00060
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 17
    Digitale Medien
    Digitale Medien
    An Action Representation Formalism to Interpret Natural Language Instructions (1998)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc.
    Computational intelligence 14 (1998), S. 0 
    Details
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: The focus of this paper is on an action representation formalism that encodes bothlinguistic andplanning knowledge about actions, and that supports the interpretation of complex Natural Language instructions and, in particular, of instructions containing Purpose Clauses. The representation uses linguistically motivated primitives, derived from Jackendoff's work on Conceptual Semantics, and is embedded in the description logic based system CLASSIC. I first motivate the characteristics of the formalism as needed to understand Natural Language instructions. I then describe the formalism itself, and I argue that the integration of a linguistically motivated lexical semantics formalism and of a description logic based system is beneficial to both. Finally, I show how the formalism is exploited by the algorithm that interprets Purpose Clauses. The output of the algorithm is used in theAnimation from NL project, that has as its goal the automatic creation of animated task simulations.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1111/0824-7935.00057
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...