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
  • 1
    Electronic Resource
    Electronic Resource
    Soft computing, labelling and granulation (1998)
    Springer
    Soft computing 2 (1998), S. 12-13 
    Details
    ISSN: 1433-7479
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s005000050026
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    MetateM: An introduction (1995)
    Springer
    Formal aspects of computing 7 (1995), S. 533-549 
    Details
    ISSN: 1433-299X
    Keywords: Modal and temporal logics ; Reactive systems ; Specification ; Prototyping ; Mechanical verification ; Non-procedural languages ; Logic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01211631
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Cut-free proof systems for logics of weak excluded middle (1999)
    Springer
    Soft computing 2 (1999), S. 147-156 
    Details
    ISSN: 1433-7479
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract  In this work we perform a proof-theoretical investigation of some logical systems in the neighborhood of substructural, intermediate and many-valued logics. The common feature of the logics we consider is that they satisfy some weak forms of the excluded-middle principle. We first propose a cut-free hypersequent calculus for the intermediate logic LQ, obtained by adding the axiom *A∨**A to intuitionistic logic. We then propose cut-free calculi for systems W n , obtained by adding the axioms *A∨(A ⊕ ⋯ ⊕ A) (n−1 times) to affine linear logic (without exponential connectives). For n=3, the system W n coincides with 3-valued Łukasiewicz logic. For n〉3, W n is a proper subsystem of n-valued Łukasiewicz logic. Our calculi can be seen as a first step towards the development of uniform cut-free Gentzen calculi for finite-valued Łukasiewicz logics.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s005000050047
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    The attack as strong negation, part I (2015)
    Oxford University Press
    Details
    Publication Date: 2015-11-25
    Description: We add strong negation N to classical logic and interpret the attack relation of ‘ x attacks y ’ in argumentation as (x-〉Ny) . We write a corresponding object level (using N only) classical theory for each argumentation network and show that the classical models of this theory correspond exactly to the complete extensions of the argumentation network. We show by example how this approach simplifies the study of abstract argumentation networks. We compare with other translations of abstract argumentation networks into logic, such as classical predicate logic or modal logics, or logic programming, and we also compare with Abstract Dialectical Frameworks.
    Print ISSN: 1367-0751
    Electronic ISSN: 1368-9894
    Topics: Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 5
    facet.materialart.
    Unknown
    Introduction to the special issue on Loops in Argumentation (2016)
    Oxford University Press
    Details
    Publication Date: 2016-07-27
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 6
    facet.materialart.
    Unknown
    The handling of loops in argumentation networks (2016)
    Oxford University Press
    Details
    Publication Date: 2016-07-27
    Description: This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are ‘in’, ‘out’ extensions, with no undecided elements.
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 7
    facet.materialart.
    Unknown
    Reactive standard deontic logic (2015)
    Oxford University Press
    Details
    Publication Date: 2015-01-29
    Description: We introduce a reactive variant of SDL (standard deontic logic): SDLR1 (reactive standard deontic logic). Given a Kripkean view on the semantics of SDL in terms of directed graphs where arrows -〉 represent the accessibility relation between worlds, reactive models add two elements: arrows -〉 are labelled as ‘active’ or ‘inactive’, and double arrows connect arrows, e.g. ( x 1 -〉 x 2 ) ( x 3 -〉 x 4 ). The idea is that passing through x 1 -〉 x 2 activates a switch represented by that inverts the label of x 3 -〉 x 4 and hence activates respectively deactivates this arrow. This allows to introduce two modalities: is the usual KD -modality of SDL and operates on the Kripkean graph where all labels and double arrows are ignored, while Ø takes them into account. We demonstrate that RSDL1 allows for an intuitive interpretation of ‘ought’. The logic can handle contrary-to-duty cases such as several instantiations of the Chisholm set in a paradox-free way by means of using double arrows and annotations to block and give access to ideal worlds.
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    Logical foundations for bipolar and tripolar argumentation networks: preliminary results (2016)
    Oxford University Press
    Details
    Publication Date: 2016-01-30
    Description: Traditional abstract argumentation networks have been studied in two directions Investigate their semantics in detail. This has lead to the study of extensions, dealing with loops, connections with classical logic, the notions joint and disjunctive attacks, and especially what concerns us here, the Equational approach and the ASPIC instantiation approach. Generalize the notion of argumentation to bipolar argumentation and to the addition of the notion of support. This article will study bipolar and tripolar argumentation networks, both from the equational point of view and by reducing them to traditional attack network. The article will avoid traditional difficulties with bipolar networks and, most importantly, it will indicate how to model the ASPIC approach (see M. Caminada and L. Amgoud. On the evaluation of argumentation formalisms), using tripolar equational networks with joint support.
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Reasoning about delegation and revocation schemes in answer set programming (2014)
    Oxford University Press
    Details
    Publication Date: 2014-01-16
    Description: In this article we show how to model a range of notions in the context of delegation and revocation applied to security scenarios. We demonstrate how a range of delegation–revocation models and policies may be represented in pictorial form and formally represented in terms of reactive Kripke models and a first-order policy specification language. We translate first-order representations of our reactive Kripke models into an equivalent Answer Set Programming form that enables users to apply flexibly well-defined definitions of predicates to represent their requirements in terms of delegation–revocation policy specification.
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    An equational approach to the merging of argumentation networks (2014)
    Oxford University Press
    Details
    Publication Date: 2014-11-20
    Description: This article concerns the merging of argumentation systems. We propose an equational approach to this problem by considering an augmented network containing the arguments and attacks of all systems to be merged and then associating a numerical weight to each of the components of the augmented network. The weights are calculated based on how the components are perceived by the agents associated with the systems being merged. The resulting weighted network is then used to define a system of equations, one for each argument, a solution of which corresponds to the overall level of acceptance of the arguments within the community.
    Print ISSN: 0955-792X
    Electronic ISSN: 1465-363X
    Topics: Computer Science , Mathematics
    Published by Oxford University Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...