Готові списки джерел за темами / Defeasible deontic logic

Зміст

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

Добірка наукової літератури з теми "Defeasible deontic logic"

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

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

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

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

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

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

Статті в журналах з теми "Defeasible deontic logic"

1

Kontopoulos, Efstratios, Nick Bassiliades, Guido Governatori, and Grigoris Antoniou. "A Modal Defeasible Reasoner of Deontic Logic for the Semantic Web." International Journal on Semantic Web and Information Systems 7, no. 1 (January 2011): 18–43. http://dx.doi.org/10.4018/jswis.2011010102.

Повний текст джерела
Анотація:
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information, whereas modal logic deals with the concepts of necessity and possibility. These types of logics play a significant role in the emerging Semantic Web, which enriches the available Web information with meaning, leading to better cooperation between end-users and applications. Defeasible and modal logics, in general, and, particularly, deontic logic provide means for modeling agent communities, where each agent is characterized by its cognitive profile and normative system, as well as policies, which define privacy requirements, access permissions, and individual rights. Toward this direction, this article discusses the extension of DR-DEVICE, a Semantic Web-aware defeasible reasoner, with a mechanism for expressing modal logic operators, while testing the implementation via deontic logic operators, concerned with obligations, permissions, and related concepts. The motivation behind this work is to develop a practical defeasible reasoner for the Semantic Web that takes advantage of the expressive power offered by modal logics, accompanied by the flexibility to define diverse agent behaviours. A further incentive is to study the various motivational notions of deontic logic and discuss the cognitive state of agents, as well as the interactions among them.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Trelles, Oscar. "Donald Nute (ed.): Defeasible Deontic Logic." Areté 13, no. 2 (December 1, 2001): 183–93. http://dx.doi.org/10.18800/arete.200102.008.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ryu, Young U. "Conditional deontic logic augmented with defeasible reasoning." Data & Knowledge Engineering 16, no. 1 (July 1995): 73–91. http://dx.doi.org/10.1016/0169-023x(95)00008-g.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Hu, Ivan. "Defeasible Tolerance and the Sorites." Journal of Philosophy 117, no. 4 (2020): 181–218. http://dx.doi.org/10.5840/jphil2020117413.

Повний текст джерела
Анотація:
I propose a novel solution to the Sorites Paradox. The account vindicates the tolerance of vague predicates in a way that properly addresses the normativity of vagueness while avoiding sorites contradiction, by treating sorites reasoning as a type of defeasible reasoning. I show how this can be done within the setting of a nonmonotonic deontic logic. Central to the proposal is its deontic interpretation of tolerance. I draw a key distinction between two types of tolerance, based on different deontic notions, and show how the account captures key differences between these types of sorites reasoning. I compare the resulting theory to various existing contextualist proposals and argue that it better accounts for the normative aspects of sorites reasoning.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Dong, Huimin. "Logic of defeasible permission and its dynamics." Journal of Logic and Computation 31, no. 4 (May 5, 2021): 1158–93. http://dx.doi.org/10.1093/logcom/exab022.

Повний текст джерела
Анотація:
Abstract This paper develops a deontic logic for defeasible permission and studies norm change in various updated semantics. When one grants that $\varphi $ or $\psi $ is permitted, normally, it goes together with the conjunction of a permission of $\varphi $ and that of $\psi $. In the monotonic reasoning on this permission, a permission of $\varphi $ leads to a permission of $\varphi $ and $\psi $; however, if a prohibition of $\psi $ is introduced, we get into trouble. We face a paradox of free choice permission. Many solutions have been proposed, but a systematic account of handling norm change is still needed. This paper first introduces the notion of normality to develop a sound and complete deontic logic for defeasible permission, which can be used to analyse several notions in natural language and in game theory. Further, following Lewis’ idea of norm change, a systematic way to capture various dynamics for updating permission and obligation is proposed.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Prakken, Henry. "Two approaches to the formalisation of defeasible deontic reasoning." Studia Logica 57, no. 1 (July 1996): 73–90. http://dx.doi.org/10.1007/bf00370670.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Nakamatsu, Kazumi. "Pipeline Valve Control Based on EVALPSN Safety Verification." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 5 (September 20, 2006): 647–56. http://dx.doi.org/10.20965/jaciii.2006.p0647.

Повний текст джерела
Анотація:
We have developed an annotated logic program called an Extended Vector Annotated Logic Program with Strong Negation (abbr. EVALPSN), which can deal with defeasible deontic reasoning and contradiction. We have already applied EVALPSN to safety verification and control such as railway interlocking safety verification. In this paper, we show how to apply EVALPSN to pipeline valve control with an example for brewery pipeline valve control. The safety verification control is based on EVALPSN programming to avoid unexpected mix of different sorts of liquid.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Nakamatsu, Kazumi. "Application of paraconsistent annotated logic program bf-EVALPSN to intelligent control." Facta universitatis - series: Electronics and Energetics 26, no. 1 (2013): 11–30. http://dx.doi.org/10.2298/fuee1301011n.

Повний текст джерела
Анотація:
A paraconsistent annotated logic program called EVALPSN has been developed for dealing with defeasible deontic reasoning and plausible reasoning, and applied to various kinds of intelligent control and safety verification. Moreover, in order to deal with before-after relation between processes(time intervals), bf(before-after)-EVALPSN has also been developed recently. In this paper, we review the reasoning system for before-after relation between processes based on bf- EVALPSN. The system consists of two groups of inference rules in bf-EVALPSN called basic and transitive bf-inference rules. The application of the reasoning system to real-time process order control is introduced with simple examples.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

LAM, HO-PUN, and MUSTAFA HASHMI. "Enabling reasoning with LegalRuleML." Theory and Practice of Logic Programming 19, no. 1 (September 14, 2018): 1–26. http://dx.doi.org/10.1017/s1471068418000339.

Повний текст джерела
Анотація:
AbstractIn order to automate verification process, regulatory rules written in natural language need to be translated into a format that machines can understand. However, none of the existing formalisms can fully represent the elements that appear in legal norms. For instance, most of these formalisms do not provide features to capture the behavior of deontic effects, which is an important aspect in automated compliance checking. This paper presents an approach for transforming legal norms represented using legalruleml to a variant of modal defeasible logic (and vice versa) such that a legal statement represented using LegalRuleML can be transformed into a machine-readable format that can be understood and reasoned about depending upon the client's preferences.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Van Der Hoek, Wiebe. "Defeasible deontic logic, edited by Donald Nute, Synthese library, vol. 263, Kluwer Academic Publishers, Dordrecht, Boston, and London, 1997, x + 354 pp." Bulletin of Symbolic Logic 6, no. 1 (March 2000): 89–94. http://dx.doi.org/10.2307/421079.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Defeasible deontic logic"

1

Trelles, Oscar. "Donald Nute (ed.): Defeasible Deontic Logic." Pontificia Universidad Católica del Perú - Departamento de Humanidades, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/113238.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Defeasible deontic logic"

1

Nute, Donald. Defeasible Deontic Logic. Dordrecht: Springer Netherlands, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Nute, Donald, ed. Defeasible Deontic Logic. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

1947-, Nute Donald, ed. Defeasible deontic logic. Dordrecht: Kluwer Academic Publishers, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Defeasible deontic logic"

1

Nute, Donald, and Xiaochang Yu. "Introduction." In Defeasible Deontic Logic, 1–16. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Prakken, Henry, and Marek Sergot. "Dyadic Deontic Logic and Contrary-to-Duty Obligations." In Defeasible Deontic Logic, 223–62. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Royakkers, Lambèr, and Frank Dignum. "Defeasible Reasoning with Legal Rules." In Defeasible Deontic Logic, 263–86. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Nute, Donald. "Apparent Obligation." In Defeasible Deontic Logic, 287–315. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_12.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Carmo, José, and Andrew J. I. Jones. "A New Approach to Contrary-to-Duty Obligations." In Defeasible Deontic Logic, 317–44. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_13.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Loui, R. P. "Alchourrón and von Wright on Conflict Among Norms." In Defeasible Deontic Logic, 345–51. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_14.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Horty, John F. "Nonmonotonic Foundations for Deontic Logic." In Defeasible Deontic Logic, 17–44. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Belzer, Marvin, and Barry Loewer. "Deontic Logics of Defeasibility." In Defeasible Deontic Logic, 45–57. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Åqvist, Lennart. "Systematic Frame Constants in Defeasible Deontic Logic." In Defeasible Deontic Logic, 59–77. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

van der Torre, Leendert W. N., and Yao-Hua Tan. "The Many Faces of Defeasibility in Defeasible Deontic Logic." In Defeasible Deontic Logic, 79–121. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8851-5_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Defeasible deontic logic"

1

Governatori, Guido, and Francesco Olivieri. "Unravel legal references in defeasible deontic logic." In ICAIL '21: Eighteenth International Conference for Artificial Intelligence and Law. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3462757.3466080.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Delgrande, James. "A Preference-Based Approach to Defeasible Deontic Inference." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/33.

Повний текст джерела
Анотація:
In this paper we present an approach to defeasible deontic inference. Given a set of rules R expressing conditional obligations and a formula A giving contingent information, the goal is to determine the most desirable outcome with respect to this information. Semantically, the rules R induce a partial preorder on the set of models, giving the relative desirability of each model. Then the set of minimal A models characterises the best that can be attained given that A holds. A syntactic approach is also given, in terms of maximal subsets of material counterparts of rules in R, and that yields a formula that expresses the best outcome possible given that A holds. These approaches are shown to coincide, providing an analogue to a soundness and completeness result. Complexity is not unreasonable, being at the second level of the polynomial hierarchy when the underlying logic is propositional logic. The approach yields desirable and intuitive results, including for the various “paradoxes” of deontic reasoning. The approach also highlights an interesting difference in how specificity is dealt with in nonmonotonic and deontic reasoning.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Nakamatsu, Kazumi. "A defeasible deontic reasoning system based on annotated logic programming." In The fourth international conference on computing anticipatory systems (CASYS 2000). AIP, 2001. http://dx.doi.org/10.1063/1.1388726.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kontopoulos, Efstratios, Nick Bassiliades, Guido Governatori, and Grigoris Antoniou. "Extending a Defeasible Reasoner with Modal and Deontic Logic Operators." In 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. IEEE, 2008. http://dx.doi.org/10.1109/wiiat.2008.164.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Nakamatsu, Kazumi. "Defeasible Deontic Robot Control Based on Extended Vector Annotated Logic Programming." In COMPUTING ANTICIPATORY SYSTEMS: CASYS 2001 - Fifth International Conference. AIP, 2002. http://dx.doi.org/10.1063/1.1503724.

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

До бібліографії