Filters








3,786 Hits in 3.9 sec

Incremental decision procedures for modal logics with nominals and eventualities [article]

Mark Kaminski, Universität Des Saarlandes, Universität Des Saarlandes
2012
Februar 2012 Mark Kaminski iii Abstract This thesis contributes to the study of incremental decision procedures for modal logics with nominals and eventualities.  ...  In particular, it yields the first incremental procedures for modal logics containing both nominals and eventualities. v  ...  All cases proceed analogously to the respective cases in the proof of Lemma 6.3.5 (with Lemma 7.2.4 in place of Lemma 6.3.4 and Proposition 7.1.2 in place of Proposition 6.2.1) except for the case where  ... 
doi:10.22028/d291-26295 fatcat:h5l26h2fjjgvjipdusysgeihgu

Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference [chapter]

Mark Kaminski, Gert Smolka
2010 Lecture Notes in Computer Science  
Framework for tableau-style decision procedures Modal logic with star modalities, difference modalities, and nominals Novel tableau system called clausal graph tableaux, in the spirit of Pratt's graph  ...  tableaux [1980], different from the usual tree tableaux First time that graph tableaux are adapted to a logic with nominals (or difference modalties) Theorem: The tableau closure of a satisfiable formula  ...  for decision procedures Algorithmic refinements are needed Incremental computation of DNF  ... 
doi:10.1007/978-3-642-16242-8_30 fatcat:kyfzyyabmvcprh6ga3h434khpy

Correctness of an Incremental and Worst-Case Optimal Decision Procedure for Modal Logic with Eventualities [article]

Mark Kaminski, Gert Smolka
2012 arXiv   pre-print
We present a simple theory explaining the construction and the correctness of an incremental and worst-case optimal decision procedure for modal logic with eventualities.  ...  The procedure provides a basis for practical provers since satisfiability and unsatisfiability of formulas can often be determined with small tableaux.  ...  An Incremental Decision Procedure We now have everything in place to formulate an incremental decision procedure.  ... 
arXiv:1209.1248v1 fatcat:4azrgee7jndktjxxjmfmwebfbu

A Goal-Directed Decision Procedure for Hybrid PDL

Mark Kaminski, Gert Smolka
2013 Journal of automated reasoning  
We present the first goal-directed decision procedure for hybrid PDL. The procedure is based on a modular approach that scales from basic modal logic with eventualities to hybrid PDL.  ...  A different family of decision procedures for PDL is based on nondeterministic search for models as pioneered for modal logic by Kripke [40].  ...  We start with a procedure for the logic K * (an extension of basic modal logic with eventualities) and stepwise extend it to more complex logics.  ... 
doi:10.1007/s10817-013-9294-5 fatcat:v3pqh3m6incf7kvfoo4kqo6e3e

4 Computational modal logic [chapter]

Ian Horrocks, Ullrich Hustadt, Ulrike Sattler, Renate Schmidt
2007 Studies in Logic and Practical Reasoning  
to provide effective and practical decision procedures for modal logics.  ...  Other extensions (counting, nominals) The modal logics K c n and K ,c n with graded modalities and the modal logic K o n with nominals can be translated to first-order logic using a number of different  ... 
doi:10.1016/s1570-2464(07)80007-3 fatcat:zrhdgzcgovfc3lxuuqnjpsa5bi

An Architecture for Autonomy

R. Alami, R. Chatila, S. Fleury, M. Ghallab, F. Ingrand
1998 The international journal of robotics research  
We developed proper tools to meet these speci cations and implement each level of the architecture: IxTeT a temporal planner, prs a procedural system for task re nement and supervision, Kheops for the  ...  Validation of temporal and logical properties of the reactive parts of the system, through these tools, are presented.  ...  This requires an incrementally designed system with common integration methodology and validation procedures for the involved developers.  ... 
doi:10.1177/027836499801700402 fatcat:kjsyayrk3fgdxpkyohgev4wkxi

The Telicity Parameter Revisited

Hana Filip
2004 Semantics and Linguistic Theory  
For every step in the examination procedure (= incremental argument), there is a corresponding part of the examination event, and vice versa. (12) The doctor examined the patient in an hour/for an hour  ...  or modal operator introduced in the same clause.  ...  interpretation can be here motivated along similar lines as in Slavic languages: be auftragen 'to commission' is atelic and Anwiilte 'lawyers' is not linked to the Incremental Theme.  ... 
doi:10.3765/salt.v14i0.2909 fatcat:mlt7zvc22rhszl6ui2ipydqmo4

The Telicity Parameter Revisited

Hana Filip
2015 Semantics and Linguistic Theory  
For every step in the examination procedure (= incremental argument), there is a corresponding part of the examination event, and vice versa. (12) The doctor examined the patient in an hour/for an hour  ...  or modal operator introduced in the same clause.  ...  interpretation can be here motivated along similar lines as in Slavic languages: be auftragen 'to commission' is atelic and Anwiilte 'lawyers' is not linked to the Incremental Theme.  ... 
doi:10.3765/salt.v0i0.2909 fatcat:4hnmdph5gjf6hjdebciwzlubxq

Analytical Method for Reactive Power Compensators Allocation

Ardiaty Arief, Muhammad Bachtiar Nappu, Antamil Antamil
2018 International Journal of Technology  
The proposed method is implemented at the modified IEEE 30-bus Reliability Test System (RTS) and compared with a different placement.  ...  The proposed method modifies the Modal analysis technique and, based on the inversed reduced Jacobian matrix, develops a new formulation to compute the Reactive Contribution Factor (RCF) of each load buses  ...  , P is the incremental change in bus real power; Q is the incremental change in bus reactive power injection;  is the incremental change in bus voltage angle; and V is the incremental change in bus  ... 
doi:10.14716/ijtech.v9i3.913 fatcat:6txuqpeohjfkrlhrnt3kydmudm

Efficiently Deciding μ-Calculus with Converse over Finite Trees

Pierre Genevès, Nabil Layaïda, Alan Schmitt, Nils Gesbert
2015 ACM Transactions on Computational Logic  
We present a sound and complete satisfiability-testing algorithm and its effective implementation for an alternation-free modal µ-calculus with converse, where formulas are cycle-free and are interpreted  ...  Our implementation is available online, and can be used to solve logical formulas of significant size and practical value. We illustrate this in the setting of XML trees.  ...  ACKNOWLEDGMENTS We thank the anonymous referees of TOCL for their valuable remarks and suggestions that significantly contributed to improving the presentation of the results described in this publication  ... 
doi:10.1145/2724712 fatcat:wohxmeje4bbataep2dcwqwbzbq

A Resolution-Based Decision Procedure for $\mathcal{SHOIQ}$ [chapter]

Yevgeny Kazakov, Boris Motik
2006 Lecture Notes in Computer Science  
We present a resolution-based decision procedure for the description logic SHOIQ-the logic underlying the Semantic Web ontology language OWL-DL.  ...  Our procedure is goal-oriented, and it naturally extends a similar procedure for SHIQ, which has proven itself in practice.  ...  This encoding is similar to the transformation of formulas of modal logic K4 into formulas of modal logic K from [44] .  ... 
doi:10.1007/11814771_53 fatcat:76vy6ymuszh4te4yqzeeiefiay

Fuzzy Evaluation of Residuals in FDI Methods

D. Maquin, J. Ragot
2000 IFAC Proceedings Volumes  
The ability of this approach to integrate a persistence index of the residual deviations and the sensitivity of the residuals with regard to faults is particularly studied.  ...  This paper presents a Fault Detection and Isolation (FDI) method based on a fuzzy evaluation of residuals. The advantages of this non-Boolean evaluation are described.  ...  PROBLEM POSITION Chow and Willsky (1984) have described the organization of a model-based Fault Detection and Isolation (FDI) procedure.  ... 
doi:10.1016/s1474-6670(17)37436-0 fatcat:q53wpfpowbekpe7v3ja7kou2qu

A Minimal Hybrid Logic for Intervals

Altaf Hussain
2006 Logic Journal of the IGPL  
By introducing an interval hybrid temporal logic, we enrich the logic with nominals, and thereby increase the expressivity of the logic.  ...  Taking our inspiration from van Benthem's treatment of temporal interval structures, and Halpern and Shoham's work on intervals, we introduce an interval hybrid temporal logic with two binary relations  ...  I would also like to express my gratitude to Maarten Marx for his helpful suggestions; to Jorge Petrucio Viana for many interesting discussions on hybrid logic and intervals, and also the anonymous referees  ... 
doi:10.1093/jigpal/jzk003 fatcat:vbqv6gtpunbfpkrjtozhbcpt6q

Language as Mechanisms for Interaction

Ruth Kempson, Ronnie Cann, Eleni Gregoromichelaki, Stergios Chatzikyriakidis
2016 Theoretical Linguistics  
The hurdle this poses for standard assumptions is that every local linguistic dependency can be distributed across speakers, with the content of what they are saying and the significance of each conversational  ...  Accordingly, we argue that the modelling of a psychologically-realistic grammar necessitates recasting the notion of natural language in terms of our ability for interaction with others and the environment  ...  Acknowledgments: There are many who deserve our thanks for ongoing work on the Dynamic Syntax framework; but our particular, fervent thanks go to those involved in work done on The Dynamics of Conversational  ... 
doi:10.1515/tl-2016-0011 fatcat:2xxntcmil5arbckekneksstvfy

A logic of sights

Cédric Dégremont, Soumya Paul, Nicholas Asher
2016 Journal of Logic and Computation  
The second one adds nominals, names for states, to the language, and is the basic hybrid logic H A over A.  ...  For instance, we extend temporal logics with horizons, while (T)PAL and FEL treat modally-definable restrictions or quantification over all such restrictions, respectively.  ...  The comments of two referees helped us produce a clearer and more complete paper.  ... 
doi:10.1093/logcom/exv077 fatcat:ndtwrvfiqncmldudoiswkfdfv4
« Previous Showing results 1 — 15 out of 3,786 results