Увійти

Готові списки джерел за темами / Labelled deductive system

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Labelled deductive system"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Labelled deductive system".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Labelled deductive system"

1

KEMPSON, RUTH, and DOV GABBAY. "Crossover: a unified view." Journal of Linguistics 34, no. 1 (March 1998): 73–124. http://dx.doi.org/10.1017/s0022226797006841.

Повний текст джерела

Анотація:

This paper informally outlines a Labelled Deductive System for on-line language processing. Interpretation of a string is modelled as a composite lexically driven process of type deduction over labelled premises forming locally discrete databases, with rules of database inference then dictating their mode of combination. The particular LDS methodology is illustrated by a unified account of the interaction of wh-dependency and anaphora resolution, the so-called ‘cross-over’ phenomenon, currently acknowledged to resist a unified explanation. The shift of perspective this analysis requires is that interpretation is defined as a proof structure for labelled deduction, and assignment of such structure to a string is a dynamic left-right process in which linearity considerations are ineliminable.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

READ, STEPHEN. "SEMANTIC POLLUTION AND SYNTACTIC PURITY." Review of Symbolic Logic 8, no. 4 (August 7, 2015): 649–61. http://dx.doi.org/10.1017/s1755020315000210.

Повний текст джерела

Анотація:

AbstractLogical inferentialism claims that the meaning of the logical constants should be given, not model-theoretically, but by the rules of inference of a suitable calculus. It has been claimed that certain proof-theoretical systems, most particularly, labelled deductive systems for modal logic, are unsuitable, on the grounds that they are semantically polluted and suffer from an untoward intrusion of semantics into syntax. The charge is shown to be mistaken. It is argued on inferentialist grounds that labelled deductive systems are as syntactically pure as any formal system in which the rules define the meanings of the logical constants.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Kolowska-Gawiejnowicz, Miroslawa. "A Labelled Deductive System for Relational Semantics of the Lambek Calculus." Mathematical Logic Quarterly 45, no. 1 (1999): 51–58. http://dx.doi.org/10.1002/malq.19990450105.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Marin, Sonia, Marianela Morales, and Lutz Straßburger. "A fully labelled proof system for intuitionistic modal logics." Journal of Logic and Computation 31, no. 3 (April 2021): 998–1022. http://dx.doi.org/10.1093/logcom/exab020.

Повний текст джерела

Анотація:

Abstract Labelled proof theory has been famously successful for modal logics by mimicking their relational semantics within deductive systems. Simpson in particular designed a framework to study a variety of intuitionistic modal logics integrating a binary relation symbol in the syntax. In this paper, we present a labelled sequent system for intuitionistic modal logics such that there is not only one but two relation symbols appearing in sequents: one for the accessibility relation associated with the Kripke semantics for normal modal logics and one for the pre-order relation associated with the Kripke semantics for intuitionistic logic. This puts our system in close correspondence with the standard birelational Kripke semantics for intuitionistic modal logics. As a consequence, it can be extended with arbitrary intuitionistic Scott–Lemmon axioms. We show soundness and completeness, together with an internal cut elimination proof, encompassing a wider array of intuitionistic modal logics than any existing labelled system.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

NEGRI, SARA, and GIORGIO SBARDOLINI. "PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS." Review of Symbolic Logic 9, no. 1 (December 1, 2015): 44–75. http://dx.doi.org/10.1017/s1755020315000295.

Повний текст джерела

Анотація:

AbstractA deductive system for Lewis counterfactuals is presented, based directly on the influential generalisation of relational semantics through ternary similarity relations introduced by Lewis. This deductive system builds on a method of enriching the syntax of sequent calculus by labels for possible worlds. The resulting labelled sequent calculus is shown to be equivalent to the axiomatic system VC of Lewis. It is further shown to have the structural properties that are needed for an analytic proof system that supports root-first proof search. Completeness of the calculus is proved in a direct way, such that for any given sequent either a formal derivation or a countermodel is provided; it is also shown how finite countermodels for unprovable sequents can be extracted from failed proof search, by which the completeness proof turns into a proof of decidability.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

D'Agostino, Marcello, and Dov M. Gabbay. "A generalization of analytic deduction via labelled deductive systems. Part I: Basic substructural logics." Journal of Automated Reasoning 13, no. 2 (1994): 243–81. http://dx.doi.org/10.1007/bf00881958.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Rasga, J. "Fibring Labelled Deduction Systems." Journal of Logic and Computation 12, no. 3 (June 1, 2002): 443–73. http://dx.doi.org/10.1093/logcom/12.3.443.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

KEMPSON, RUTH. "Ellipsis in a Labelled Deduction System." Logic Journal of IGPL 3, no. 2-3 (1995): 489–526. http://dx.doi.org/10.1093/jigpal/3.2-3.489.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Fu, Jun, Jinzhao Wu, and Hongyan Tan. "A Deductive Approach towards Reasoning about Algebraic Transition Systems." Mathematical Problems in Engineering 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/607013.

Повний текст джерела

Анотація:

Algebraic transition systems are extended from labeled transition systems by allowing transitions labeled by algebraic equations for modeling more complex systems in detail. We present a deductive approach for specifying and verifying algebraic transition systems. We modify the standard dynamic logic by introducing algebraic equations into modalities. Algebraic transition systems are embedded in modalities of logic formulas which specify properties of algebraic transition systems. The semantics of modalities and formulas is defined with solutions of algebraic equations. A proof system for this logic is constructed to verify properties of algebraic transition systems. The proof system combines with inference rules decision procedures on the theory of polynomial ideals to reduce a proof-search problem to an algebraic computation problem. The proof system proves to be sound but inherently incomplete. Finally, a typical example illustrates that reasoning about algebraic transition systems with our approach is feasible.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

OEHRLE, DICK. "Some 3-Dimensional Systems of Labelled Deduction." Logic Journal of IGPL 3, no. 2-3 (1995): 429–48. http://dx.doi.org/10.1093/jigpal/3.2-3.429.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Labelled deductive system"

1

Bjurling, Bjorn. "A labelled deductive system for reasoning about random experiments." Thesis, Imperial College London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428123.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Jiang, Yan. "Logical dependency in quantification." Thesis, University College London (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306968.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Rothenberg, Robert. "On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics." Thesis, University of St Andrews, 2010. http://hdl.handle.net/10023/1350.

Повний текст джерела

Анотація:

In this thesis we examine the relationship between hypersequent and some types of labelled sequent calculi for a subset of intermediate logics—logics between intuitionistic (Int), and classical logics—that have geometric Kripke semantics, which we call Int∗/Geo. We introduce a novel calculus for a fragment of first-order classical logic, which we call partially-shielded formulae (or PSF for short), that is adequate for expressing the semantic validity of formulae in Int∗/Geo, and apply techniques from correspondence theory to provide translations of hypersequents, simply labelled sequents and relational sequents (simply labelled sequents with relational formulae) into PSF. Using these translations, we show that hypersequents and simply labelled sequents for calculi in Int∗/Geo share the same models. We also use these translations to justify various techniques that we introduce for translating simply labelled sequents into relational sequents and vice versa. In particular, we introduce a technique called "transitive unfolding" for translating relational sequents into simply labelled sequents (and by extension, hypersequents) which preserves linear models in Int∗/Geo. We introduce syntactic translations between hypersequent calculi and simply labelled sequent calculi. We apply these translations to a novel hypersequent framework HG3ipm∗ for some logics in Int∗/Geo to obtain a corresponding simply labelled sequent framework LG3ipm∗, and to an existing simply labelled calculus for Int from the literature to obtain a novel hypersequent calculus for Int. We introduce methods for translating a simply labelled sequent calculus into a cor- responding relational calculus, and apply these methods to LG3ipm∗ to obtain a novel relational framework RG3ipm∗ that bears similarities to existing calculi from the literature. We use transitive unfolding to translate proofs in RG3ipm∗ into proofs in LG3ipm∗ and HG3ipm∗ with the communication rule, which corresponds to the semantic restriction to linear models.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

KARAFILI, Erisa. "Deduction and algorithmic approaches to reason about risk, privacy and security in multi-agent systems." Doctoral thesis, 2014. http://hdl.handle.net/11562/696564.

Повний текст джерела

Анотація:

Recentemente c'è stato un crescente interesse per la privacy e il suo controllo nei sistemi multi-agente. La necessità di condividere le informazioni e il desiderio di mantenerli privati sono due concetti in competizione , in alcuni casi anche in conflitto, che incidono sui sistemi multi-agente, in particolare nei sistemi collaborativi. Il problema principale che ho affrontato è la protezione della sicurezza nei sistemi multi-agente. In questa tesi propongo diversi approcci, che sono tutti collegati gli uni agli altri. Il primo approccio è quello algoritmico, che viene utilizzato per garantire la sicurezza di un sistema multi-agente dagli attacchi compiuti dai suoi membri. In seguito presento un metodo deduttivo, che permette di effettuare una analisi del rischio. L'approccio deduttivo è composto da un tableau system che si basa su una struttura che permette la rappresentazione e il ragionamento sul rischio. Il tableau system utilizza le relazioni causali tra eventi. Per migliorare l'analisi dei rischi presento una logica con il suo sistema di riscrittura che trova svolgimenti plausibili di eventi (che sono eventi legati tra loro da diversi rapporti causali).
Recently there has been an increasing interest in privacy and its control in multi-agent systems. The need to share information and the desire to keep it private are two competing concepts, in some cases even in conflict, which affect the multi-agent systems, in particular collaboration systems. The main problem that I deal with is the protection of security in multi-agent systems. I propose different approaches, which are all related to each other. The first approach is an algorithmic one, used for ensuring a multi-agent system from different attacks performed by its members. I later introduce a deductive approach, which permits one to perform risk analysis. The deductive approach is composed by a tableau system that is based on a framework for representing and reasoning about risk. This tableau system uses the causal relations between events. For improving the risk analysis I introduce a logic with its rewriting system that finds plausible courses of events (that are events related to each other by different causal relations).

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Labelled deductive system"

1

Gabbay, Dov M. Labelled deductive systems. Oxford: Clarendon Press, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Gabbay, Dov M. Labelled Deductive Systems. Oxford University Press, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

(Editor), Krysia Broda, ed. Compiled Labelled Deductive Systems: A Uniform Presentation of Non-Classical Logics (Studies in Logic and Computation). Institute of Physics Publishing, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Labelled deductive system"

1

Chau, Hiu Fai. "A proof search system for a modal substructural logic based on labelled deductive systems." In Logic Programming and Automated Reasoning, 64–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56944-8_42.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Gabbay, Dov M. "Introduction to Labelled Deductive Systems." In Handbook of Philosophical Logic, 179–266. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-6600-6_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Gabbay, D. M. "Abduction in Labelled Deductive Systems." In Abductive Reasoning and Learning, 99–154. Dordrecht: Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-017-1733-5_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Viganò, Luca. "Labelled Natural Deduction Systems for Propositional Modal Logics." In Labelled Non-Classical Logics, 17–52. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3208-5_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Viganò, Luca. "Labelled Natural Deduction Systems for Quantified Modal Logics." In Labelled Non-Classical Logics, 91–113. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3208-5_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Viganò, Luca. "Labelled Natural Deduction Systems for Propositional Non-Classical Logics." In Labelled Non-Classical Logics, 53–89. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3208-5_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Indrzejczak, Andrzej. "Labelled Systems in Modal Logics." In Natural Deduction, Hybrid Systems and Modal Logics, 259–96. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-90-481-8785-0_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Russo, Alessandra. "Generalising Propositional Modal Logic Using Labelled Deductive Systems." In Applied Logic Series, 57–73. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-0349-4_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Gabbay, D. M. "Abduction in labelled deductive systems a conceptual abstract." In Lecture Notes in Computer Science, 1–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54659-6_58.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Rasga, João, Amílcar Sernadas, Cristina Sernadas, and Luca Viganò. "Labelled Deduction over Algebras of Truth-Values*." In Frontiers of Combining Systems, 222–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45988-x_18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Labelled deductive system"

1

Caleiro, Carlos, Luca Viganò, and Marco Volpe. "A Labeled Deduction System for the Logic UB." In 2013 20th International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2013. http://dx.doi.org/10.1109/time.2013.14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Vigan, Luca, and Marco Volpe. "Labeled Natural Deduction Systems for a Family of Tense Logics." In 2008 15th International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2008. http://dx.doi.org/10.1109/time.2008.28.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!