ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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  (121)
  • logic programming  (62)
  • classification  (59)
  • Springer  (121)
  • American Association for the Advancement of Science
  • Wiley
  • Informatik  (121)
Sammlung
  • Artikel  (121)
Verlag/Herausgeber
  • Springer  (121)
  • American Association for the Advancement of Science
  • Wiley
Erscheinungszeitraum
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Queueing systems 27 (1997), S. 227-250 
    ISSN: 1572-9443
    Schlagwort(e): polling systems ; heavy traffic ; expected delay ; exhaustiveness ; monotonicity ; service disciplines ; classification
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Constraints 2 (1997), S. 131-162 
    ISSN: 1572-9354
    Schlagwort(e): contructive negation ; logic programming ; interval arithmetic ; constraint logic programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract A system which extracts a dataflow graph from sets of arithmetic constraints is described. This information is used to simplify constraints and to extract positive information from negations of constraints. The context for this work is a Prolog implementation where intervals are used to represent the underlying arithmetic variables. The system uses simple information about the existence of solutions of primitive constraints to derive the dataflow graph. This makes the system easily extensible to new primitives and domains. A practical implementation over both real and integer arithmetic is described and an extended example of its application given.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Constraints 4 (1999), S. 313-335 
    ISSN: 1572-9354
    Schlagwort(e): logic programming ; mathematical programming ; interval computations ; constraint-directed search
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Constraint programming languages stem from the integration of constraints in conditional rules. By taking a close look at the design choices made for Prolog IV, the author retraces the general evolution of this recent and novel paradigm, from its roots in inference systems and optimization, to its applications in model building and problem solving.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Grammars 1 (1998), S. 103-153 
    ISSN: 1572-848X
    Schlagwort(e): classification ; constraint grammars ; knowledge management
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Allgemeine und vergleichende Sprach- und Literaturwissenschaft. Indogermanistik. Außereuropäische Sprachen und Literaturen , Informatik
    Notizen: Abstract Classifying linguistic objects is a widespread and important linguistic task, but hand deducing a classificatory system from a general linguistic theory can consume much effort and introduce pernicious errors. We present an abstract prototype device that effectively deduces an accurate classificatory system from a finite linguistic theory.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Minds and machines 1 (1991), S. 417-436 
    ISSN: 1572-8641
    Schlagwort(e): Defeasible reasoning ; entailment ; justification ; logic programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Philosophie
    Notizen: Abstract The general conditions of epistemic defeat are naturally represented through the interplay of two distinct kinds of entailment, deductive and defeasible. Many of the current approaches to modeling defeasible reasoning seek to define defeasible entailment via model-theoretic notions like truth and satisfiability, which, I argue, fails to capture this fundamental distinction between truthpreserving and justification-preserving entailments. I present an alternative account of defeasible entailment and show how logic programming offers a paradigm in which the distinction can be captured, allowing for the modeling of a larger range of types of defeat. This is possible through a natural extension of the declarative and procedural semantics of Horn clauses.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Artificial intelligence and law 4 (1996), S. 331-368 
    ISSN: 1572-8382
    Schlagwort(e): argumentation ; defeasibility ; dialectics ; rule conflicts ; logic programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Rechtswissenschaft
    Notizen: Abstract Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible argumentation. Its language, which is of a logic-programming-like nature, has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled. The proof theory of the system is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument. An argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. Despite this dialectical form, the system reflects a ‘declarative’, or ‘relational’ approach to modelling legal argument. A basic assumption of this paper is that this approach complements two other lines of research in AI and Law, investigations of precedent-based reasoning and the development of ‘procedural’, or ‘dialectical’ models of legal argument.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Springer
    Artificial intelligence and law 3 (1995), S. 191-208 
    ISSN: 1572-8382
    Schlagwort(e): learning ; theory revision ; logic programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Rechtswissenschaft
    Notizen: Abstract In this paper we discuss a view of the Machine Learning technique called Explanation-Based Learning (EBL) or Explanation-Based Generalization (EBG) as a process for the interpretation of vague concepts in logic-based models of law. The open-textured nature of legal terms is a well-known open problem in the building of knowledge-based legal systems. EBG is a technique which creates generalizations of given examples on the basis of background domain knowledge. We relate these two topics by considering EBG's domain knowledge as corresponding to statute law rules, and EBG's training example as corresponding to a precedent case. By making the interpretation of vague predicates as guided by precedent cases, we use EBG as an effective process capable of creating a link between predicates appearing as open-textured concepts in law rules, and predicates appearing as ordinary language wording for stating the facts of a case. Standard EBG algorithms do not change the deductive closure of the domain theory. In the legal context, this is only adequate when concepts vaguely defined in some law rules can be reformulated in terms of other concepts more precisely defined in other rules. We call ‘theory reformulation’ the process adopted in this situation of ‘complete knowledge’. In many cases, however, statutory law leaves some concepts completely undefined. We then propose extensions to the EBG standard that deal with this situation of ‘incomplete knowledge’, and call ‘theory revision’ the extended process. In order to fill in ‘knowledge gaps’ we consider precedent cases supplemented by additional heuristic information. The extensions proposed treat heuristics represented by abstraction hierarchies with constraints and exceptions. In the paper we also precisely characterize the distinction between theory reformulation and theory revision by stating formal definitions and results, in the context of the Logic Programming theory. We offer this proposal as a possible contribution to cross fertilization between machine learning and legal reasoning methods.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    Computers and the humanities 22 (1988), S. 173-182 
    ISSN: 1572-8412
    Schlagwort(e): singing games ; songs ; folk songs ; analysis ; style ; computer-aided ; Kodály ; Bartók ; melodic patterns ; classification
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Medien- und Kommunikationswissenschaften, Kommunikationsdesign
    Notizen: Abstract To structure a music education program in Canada based on the Hungarian model, Bartók's “grammatical principle” was adopted to define the musical characteristics of British-Canadian children's traditional songs. A computer-aided methodology analyzed a sample of singing games from a personal collection to identify 4-phrase variants, and extracted and tabulated by phrasal position their common phrase patterns of equal length. Future programs will complete the phrase analysis and analyze other musical characteristics, grouping variants successively to determine the styles of the entire collection.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Springer
    Computers and the humanities 29 (1995), S. 449-461 
    ISSN: 1572-8412
    Schlagwort(e): neural networks ; stylometric analysis ; Shakespeare ; Fletcher ; discrimination ; classification
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Medien- und Kommunikationswissenschaften, Kommunikationsdesign
    Notizen: Abstract In this paper we show, for the first time, how Radial Basis Function (RBF) network techniques can be used to explore questions surrounding authorship of historic documents. The paper illustrates the technical and practical aspects of RBF's, using data extracted from works written in the early 17th century by William Shakespeare and his contemporary John Fletcher. We also present benchmark comparisons with other standard techniques for contrast and comparison.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    Minds and machines 5 (1995), S. 69-87 
    ISSN: 1572-8641
    Schlagwort(e): Meaning ; reference ; disjunction problem ; situation theory ; synonymy ; classification ; causal theory of reference ; co-ordination
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Philosophie
    Notizen: Abstract A basic theme of Winograd and Flores (1986) is that the principal function of language is to co-ordinate social activity. It is, they claim, from this function that meaning itself arises. They criticise approaches that try to understand meaning through the mechanisms of reference, the Rationalist Tradition as they call it. To seek to ground meaning in social practice is not new, but the approach is presently attractive because of difficulties encountered with the notion of reference. Without taking a view on whether these are insuperable, the present paper accepts Winograd and Flores' challenge and attempts to lay aside reference and to base a conception of meaning directly in terms of co-ordination and consensus within a linguistic community.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...