ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (12)
  • Blackwell Publishers Inc  (12)
  • American Meteorological Society
  • Blackwell Publishing Ltd
  • Springer Nature
  • Springer Science + Business Media
  • 2000-2004  (12)
  • 1960-1964
  • 2000  (12)
  • Computer Science  (12)
  • Philosophy
Collection
  • Articles  (12)
Source
Publisher
Years
  • 2000-2004  (12)
  • 1960-1964
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Introduction to the Special Issue on Time and Temporal Reasoning[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00109
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Parsing and Interpretation in the Minimalist Paradigm (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper, we discuss how recent theoretical linguistic research focusing on the Minimalist Program (MP) (Cho95, Mar95, Zwa94) can be used to guide the parsing of a useful range of natural language sentences and the building of a logical representation in a principles-based manner. We discuss the components of the MP and give an example derivation. We then propose parsing algorithms that recreate the derivation structure starting with a lexicon and the surface form of a sentence. Given the approximated derivation structure, MP principles are applied to generate a logical form, which leads to linguistically based algorithms for determining possible meanings for sentences that are ambiguous due to quantifier scope.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00117
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A Qualitative Model for Time Granularity[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper addresses the problem of granularity in temporal representation in the context of text analysis. In contrast with other fields where granularity levels are essentially quantitative, in natural language the different levels are not always precisely defined and granularity is of a more subtle and qualitative nature. A model is proposed for representing such phenomena, based on time units and time units intervals. Time units represent chunks of time which are considered indivisible at a given granularity level, but which may be refined and contain other time units or intervals at a higher granularity level. The structure of the set of time units and intervals is studied and a relation algebra is defined which extends the traditional Allen's Point or Interval Algebra. Weak and strong representations of this algebra are proposed. We claim that such representations, called grained temporal structures, are adequate for coping with dynamic qualitative changes of granularity. A logic with restricted quantifiers is proposed for formalizing temporal knowledge and examples are discussed which show the relevance of the model for natural language analysis.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00110
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Constraint Reasoning about Repeating Events: Satisfaction and Optimization[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Effective manipulation of temporal information about periodic events is required for solving complex problems such as long-range scheduling or querying temporal information. Furthermore, many problems involving repeating events involve the optimization of temporal aspects of these events (e.g., minimizing make-span in job-shop scheduling). In this paper, a constraint-based formulation of reasoning problems with repeating events is presented, and its complexity is analyzed for a range of problems. Optimization constraints are interpreted formally using the Semiring CSPs (SCSP) representation of optimization in constraint reasoning. This allows for familiar algorithms such as branch-and-bound to be applied to solving them.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00113
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A Guided Tour through some Extensions of the Event Calculus[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. In this paper, we conduct a systematic analysis of EC by which we gain a better understanding of this formalism and determine ways of augmenting its expressive power. The keystone of this endeavor is the definition of an extendible formal specification of its functionalities. This formalization has the effects of casting determination of MVIs as a model checking problem, of setting the ground for studying and comparing the expressiveness and complexity of various extensions of EC, and of establishing a semantic reference against which to verify the soundness and completeness of implementations.We extend the range of queries accepted by EC, which is limited to Boolean combinations of MVI verification or computation requests, to support arbitrary quantification over events and modal queries. We also admit specifications based on preconditions. We demonstrate the added expressive power by encoding a number of diagnosis problems. Moreover, we provide a systematic comparison of the expressiveness and complexity of the various extended event calculi against each other. Finally, we propose a declarative encoding of these enriched event calculi in the logic programming language λProlog and prove the soundness and completeness of the resulting logic programs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00115
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Temporal Reasoning and Bayesian Networks (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This work examines important issues in probabilistic temporal representation and reasoning using Bayesian networks (also known as belief networks). The representation proposed here utilizes temporal (or dynamic) probabilities to represent facts, events, and the effects of events. The architecture of a belief network may change with time to indicate a different causal context. Probability variations with time capture temporal properties such as persistence and causation. They also capture event interaction, and when the interaction between events follows known models such as the competing risks model, the additive model, or the dominating event model, the net effect of many interacting events on the temporal probabilities can be calculated efficiently. This representation of reasoning also exploits the notion of temporal degeneration of relevance due to information obsolescence to improve the efficiency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00116
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    On Resolving Conflicts Between Arguments (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Argument systems are based on the idea that one can construct arguments for propositions—structured reasons justifying the belief in a proposition. Using defeasible rules, arguments need not be valid in all circumstances, therefore, it might be possible to construct an argument for a proposition as well as its negation. When arguments support conflicting propositions, one of the arguments must be defeated, which raises the question of which (sub-) arguments can be subject to defeat.In legal argumentation, metarules determine the valid arguments by considering the last defeasible rule of each argument involved in a conflict. Since it is easier to evaluate arguments using their last rules, can a conflict be resolved by considering only the last defeasible rules of the arguments involved?We propose a new argument system where, instead of deriving a defeat relation between arguments, arguments for the defeat of defeasible rules are constructed. This system allows us to determine a set of valid (undefeated) arguments in linear time using an algorithm based on a JTMS, allows conflicts to be resolved using only the last rules of the arguments, allows us to establish a relation with Default Logic, and allows closure properties such as cumulativity to be proved. We propose an extension of the argument system based on a proposal for reasoning by cases in default logic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00120
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Strategies in Human Nonmonotonic Reasoning (2000)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Although humans seem adept at drawing nonmonotonic conclusions, the nonmonotonic reasoning systems that researchers develop are complex and do not function with such ease. This paper explores people's reasoning processes in nonmonotonic problems. To avoid the problem of people's conclusions being based on knowledge rather than on some reasoning process, we developed a scenario about life on another planet. Problems were chosen to allow the systematic study of people's understanding of strict and nonstrict rules and their interactions. We found that people had great difficulty reasoning and we identified a number of negative factors influencing their reasoning. We also identified three positive factors which, if used consistently, would yield rational and coherent reasoning—but no subject achieved total consistency. (Another possible positive factor, specificity, was considered but we found no evidence for its use.) It is concluded that nonmonotonic reasoning is hard. When people need to reason in a domain where they have no preconceived ideas, the foundation for their reasoning is neither coherent nor rational. They do not use a nonmonotonic reasoning system that would work regardless of content. Thus, nonmonotonic reasoning systems that researchers develop are expected to do more reasoning than humans actually do!
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00119
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Integrated Temporal Reasoning with Periodic Events[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In many areas of Computer Science, including planning, workflows, guidelines, and protocol management, one has to deal with abstract plans, procedures, or schedules involving temporal constraints between classes of actions that have to be repeated at periodic times and may be instantiated in different ways for different executions of the plans (procedures, schedules). In this paper we propose an integrated framework to deal with both qualitative temporal constraints on classes of actions and temporal constraints between instances of actions, in which temporal reasoning is used to amalgamate both types of constraints and to check their consistency. In particular, we consider an expressive formalism to deal with temporal constraints between classes of actions (with special attention to periodic actions) which takes into account different components such as frame times, numeric quantification, periods, and qualitative relations. We define the notions of (contextual) concretization of qualitative temporal constraints between classes and use this notion to formally define the consistency of a knowledge base of temporal constraints between classes and a set of temporal constraints on instances, and to define the algorithm for checking such a consistency. An application for scheduling lessons in a school is shown in an example.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00112
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Model-Based Visualization of Temporal Abstractions[Address co] (2000)
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Computational intelligence 16 (2000), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We describe a new conceptual methodology and related computational architecture called Knowledge-based Navigation of Abstractions for Visualization and Explanation (KNAVE). KNAVE is a domain-independent framework specific to the task of interpretation, summarization, visualization, explanation, and interactive exploration, in a context-sensitive manner, of time-oriented raw data and the multiple levels of higher level, interval-based concepts that can be abstracted from these data. The KNAVE domain-independent exploration operators are based on the relations defined in the knowledge-based temporal-abstraction problem-solving method, which is used to abstract the data, and thus can directly use the domain-specific knowledge base on which that method relies. Thus, the domain-specific semantics are driving the domain-independent visualization and exploration processes, and the data are viewed through a filter of domain-specific knowledge. By accessing the domain-specific temporal-abstraction knowledge base and the domain-specific time-oriented database, the KNAVE modules enable users to query for domain-specific temporal abstractions and to change the focus of the visualization, thus reusing for a different task (visualization and exploration) the same domain model acquired for abstraction purposes. We focus here on the methodology, but also describe a preliminary evaluation of the KNAVE prototype in a medical domain. Our experiment incorporated seven users, a large medical patient record, and three complex temporal queries, typical of guideline-based care, that the users were required to answer and/or explore. The results of the preliminary experiment have been encouraging. The new methodology has potentially broad implications for planning, monitoring, explaining, and interactive data mining of time-oriented data.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00114
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...