Готові списки джерел за темами / Quantitative and logical reasoning

Добірка наукової літератури з теми "Quantitative and logical reasoning"

Автор: Grafiati
Опубліковано: 26 липня 2024
Оновлено: 27 липня 2024

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

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

Зміст

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

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

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

Статті в журналах з теми "Quantitative and logical reasoning"

1

Warsitasari, Wahyu Dwi, and Imam Rofiki. "UTILIZING GEOGEBRA FOR SOLVING ECONOMIC MATHEMATICS PROBLEMS: PROMOTING LOGICAL REASONING IN PROBLEM-BASED LEARNING." AKSIOMA: Jurnal Program Studi Pendidikan Matematika 12, no. 3 (September 30, 2023): 3445. http://dx.doi.org/10.24127/ajpm.v12i3.7300.

Повний текст джерела
Анотація:
Logical reasoning is very important to be used by as the basis of creative activities such as creating or applying mathematical concepts in the real world. By implementing Problem-Based Learning (PBL) with GeoGebra's assistance, logical reasoning abilities can be developed. This research intends to investigate the effect of utilizing GeoGebra to support PBL on students' capacity for logical reasoning while addressing economic mathematics problems. This study employed a quantitative method with one group pretest-posttest quasi-experimental research design. GeoGebra was used in classroom instruction as part of the PBL model to help students solve economic math problems logically. Following the implementation of PBL with the aid of GeoGebra, it may be inferred that there are disparities in students' capacities for logical reasoning based on the non-parametric statistical test of the Wilcoxon test. These findings demonstrate that using GeoGebra in collaboration with problem-based learning improves students' capacity for logical reasoning. GeoGebra-assisted PBL is recommended to be used as a medium to assist students in developing logical reasoning in solving economic mathematics problems.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Rahmawati, Rahmawati, Edy Kurniawan, and A. Muafiah Nur. "Identifikasi Kemampuan Berpikir Logis Mahasiswa Calon Guru Fisika Menggunakan Instrument TOLT." Jurnal Pendidikan Fisika dan Teknologi 7, no. 1 (June 20, 2021): 27. http://dx.doi.org/10.29303/jpft.v7i1.2719.

Повний текст джерела
Анотація:
This study aimed to identify the type of reasoning and the level of prospective physics teacher students’ logical thinking ability. This type of research was a field study with a quantitative descriptive method. The test was the technique used in collecting data of this study. The instrument used in this study was the standard test like Test of Logical Thinking (TOLT). This test consists of 10 questions that measured five types of reasoning, namely proportional reasoning, variable control, probabilistic reasoning, correlation reasoning, and combination reasoning. The level of logical thinking ability was distinguished into concrete, transitional, and formal thinking operational. The sample of this study was students of physics teacher candidates at the first-year level, totaling 30 students. All of data was analyzed by quantitative descriptive. In general, students tend to the type of proportional reasoning and controlling variables and less on probabilistic reasoning. Based on the level of logical thinking ability, the results showed that the percentage of 30 students who were in the concrete, transitional, and formal categories, respectively, were 30%, 30%, and 60%. This data becomes the basis for consideration in the development of learning models and learning assessments used in lectures, especially in Department of Physics Education in one of the University in Makassar city, so that they are able to contribute to the development of students' level of logical thinking skills as a provision for the next life.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sopian, Herman. "Deskripsi Kemampuan Berpikir Logis dan Pemahaman Konsep Sistem Hormon pada Siswa Kelas XI SMA." Edubiologica Jurnal Penelitian Ilmu dan Pendidikan Biologi 7, no. 2 (December 28, 2019): 85. http://dx.doi.org/10.25134/edubiologica.v7i2.3023.

Повний текст джерела
Анотація:
This study aimed to obtain information about logical thinking ability and understanding of the concept of students on the hormonal system material. This study was conducted in class XI in one of the high schools in the Serang city. The method used is descriptive quantitative. This quantitative descriptive method to describe, explain and interpret the logical thinking ability and understanding of students on the hormonal system concept by using instruments such as diagnostic tests and about the three-tier test and test of logical thinking (TOLT). The sampling technique is done by cluster random sampling as many as 33 students. Based on the results obtained TOLT that categorized either proportional reasoning, reasoning control variable and low category correlational reasoning, and reasoning probability and combinatorial reasoning sufficient category. Based on the three-tier test results showed that students had difficulty understanding especially on subconcepts hormone function as well as differences in the hormone system and nervous system�
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Tambunan, Janwar. "ANALISIS MODEL PEMBELAJARAN BLENDED LEARNING TERHADAP PEMAHAMAN DAN PENALARAN LOGIS MAHASISWA." Jurnal Suluh Pendidikan 9, no. 2 (September 29, 2021): 80–89. http://dx.doi.org/10.36655/jsp.v9i2.587.

Повний текст джерела
Анотація:
This study aims to determine whether the increase in students' understanding ability with the blended learning learning model is better than the understanding ability of students whose learning uses conventional learning models in terms of every aspect of understanding ability and whether the increase in students' logical reasoning with the blended learning learning model is better than students' logical reasoning. with conventional learning models. This study uses a quantitative research approach with experimental methods in the form of quasi-experiments. The population in this study were students of the Christian religious education study program, FKIP University HKBP Nommensen. The population was taken randomly (Cluster Random Sampling). The instrument used consisted of a test of understanding and logical reasoning in the form of a description. The instrument was declared to have met the requirements of content validity and reliability coefficient. Based on the results of the analysis, the research results obtained that the increase in students' understanding abilities with the blended learning learning model is better than the understanding abilities of students whose learning uses conventional learning models, and the increase in students' logical reasoning with the blended learning learning model is better than the logical reasoning of students with conventional learning models
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Sartor, Giovanni. "The Logic of Proportionality: Reasoning with Non-Numerical Magnitudes." German Law Journal 14, no. 8 (August 1, 2013): 1419–56. http://dx.doi.org/10.1017/s2071832200002339.

Повний текст джерела
Анотація:
This paper aims at explaining the basic logical structure of proportionality assessments, under the assumption that such assessments are based on quantitative reasoning, even when no numbers are given.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Syafitri, Rani, Zetra Hainul Putra, and Eddy Noviana. "Fifth Grade Students’ Logical Thinking in Mathematics." JOURNAL OF TEACHING AND LEARNING IN ELEMENTARY EDUCATION (JTLEE) 3, no. 2 (July 31, 2020): 157. http://dx.doi.org/10.33578/jtlee.v3i2.7840.

Повний текст джерела
Анотація:
The purpose of this study was to investigate fifth-grade students’ logical thinking in mathematics. Their logical thinking skills were categorized based on five levels, namely very low, low, medium, high and very high. This study used descriptive quantitative method, and it was conducted with 123 fifth-grade students from a public elementary school in Pekanbaru, Riau, Indonesia. The instruments used to collect data were logical thinking ability tests consisting of short answer tasks and mathematical reasoning for the given answers. The results of this study indicated that students have very low logical thinking within the average score of 22.76%. More than half of students could not give correct answers to the given tasks and also could not provide reasoning to their answers. The implication of this study is that teachers, teacher educators, curriculum developers, and government need to develop learning instruction that support students’ logical thinking in facing challenges in 21st century life.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

M. H. Gedig and S. F. Stiemer. "Qualitative & Semi-Quantitative Reasoning Techniques for Engineering Projects at Conceptual Stage." Electronic Journal of Structural Engineering 3 (January 1, 2003): 67–88. http://dx.doi.org/10.56748/ejse.331.

Повний текст джерела
Анотація:
During the development of engineering projects, the level of uncertainty is not static. The level of uncertainty typically diminishes from the early, conceptual stages of the project to the latter, detailed stages. At the present time there are many tools available to the engineer for reasoning with relatively low levels of uncertainty. Unfortunately there are few resources available for drawing sound conclusions from information that is characterized by a high level of uncertainty. Since decisions made early in the project cycle generally have a greater financial impact than those made later, it is worthwhile to investigate tools which are able to provide systematic and logical evaluation of preliminary or conceptual designs. This paper investigates sound techniques for evaluating projects at the early stages, including qualitative reasoning and semi-quantitative reasoning. The paper shows that qualitative analysis methods enable the engineer to reason with a high level of abstraction. As a normal engineering project progresses, more numeric information becomes available, and the results of semi-quantitative reasoning become more useful.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Ibeling, Duligur, and Thomas Icard. "Probabilistic Reasoning Across the Causal Hierarchy." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 06 (April 3, 2020): 10170–77. http://dx.doi.org/10.1609/aaai.v34i06.6577.

Повний текст джерела
Анотація:
We propose a formalization of the three-tier causal hierarchy of association, intervention, and counterfactuals as a series of probabilistic logical languages. Our languages are of strictly increasing expressivity, the first capable of expressing quantitative probabilistic reasoning—including conditional independence and Bayesian inference—the second encoding do-calculus reasoning for causal effects, and the third capturing a fully expressive do-calculus for arbitrary counterfactual queries. We give a corresponding series of finitary axiomatizations complete over both structural causal models and probabilistic programs, and show that satisfiability and validity for each language are decidable in polynomial space.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

M. H. Gedig and S. F. Stiemer. "Computer Application to Study Engineering Projects at the Early Stages of Development." Electronic Journal of Structural Engineering 3 (January 1, 2003): 43–66. http://dx.doi.org/10.56748/ejse.330.

Повний текст джерела
Анотація:
This paper describes a computer software application, the Qualitative Engineering System (QES), which the engineer can use to perform qualitative and semi-quantitative analysis of preliminary engineering designs. In engineering practice, many situations arise in which the engineer wishes to perform a logical, objective comparison between conceptual or preliminary design options. Although there exist many applications which can be used to perform detailed numerical analysis to justify detailed final designs, relatively fewuseful programs are available to validate designs at the preliminary stages. The early stages of design are characterized by higher levels of uncertainty than the latter stages. Established qualitative and semiquantitative reasoning techniques may be used to detail with uncertainty and incomplete information in a sound, logical manner. The QES application utilizes a unified framework, which is used to implement a number of qualitative and semi-quantitative reasoning techniques. This paper gives an explanation of qualitative and semi-quantitative analysis in the context of the QES application. In addition, the paper gives some practical examples of how the QES program can be used in the engineering environment
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Niu, Yue, Jonathan Sterling, Harrison Grodin, and Robert Harper. "A cost-aware logical framework." Proceedings of the ACM on Programming Languages 6, POPL (January 16, 2022): 1–31. http://dx.doi.org/10.1145/3498670.

Повний текст джерела
Анотація:
We present calf , a c ost- a ware l ogical f ramework for studying quantitative aspects of functional programs. Taking inspiration from recent work that reconstructs traditional aspects of programming languages in terms of a modal account of phase distinctions , we argue that the cost structure of programs motivates a phase distinction between intension and extension . Armed with this technology, we contribute a synthetic account of cost structure as a computational effect in which cost-aware programs enjoy an internal noninterference property: input/output behavior cannot depend on cost. As a full-spectrum dependent type theory, calf presents a unified language for programming and specification of both cost and behavior that can be integrated smoothly with existing mathematical libraries available in type theoretic proof assistants. We evaluate calf as a general framework for cost analysis by implementing two fundamental techniques for algorithm analysis: the method of recurrence relations and physicist’s method for amortized analysis . We deploy these techniques on a variety of case studies: we prove a tight, closed bound for Euclid’s algorithm, verify the amortized complexity of batched queues, and derive tight, closed bounds for the sequential and parallel complexity of merge sort, all fully mechanized in the Agda proof assistant. Lastly we substantiate the soundness of quantitative reasoning in calf by means of a model construction.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Quantitative and logical reasoning"

1

Videla, Santiago. "Reasoning on the response of logical signaling networks with answer set programming." Phd thesis, Universität Potsdam, 2014. http://opus.kobv.de/ubp/volltexte/2014/7189/.

Повний текст джерела
Анотація:
Deciphering the functioning of biological networks is one of the central tasks in systems biology. In particular, signal transduction networks are crucial for the understanding of the cellular response to external and internal perturbations. Importantly, in order to cope with the complexity of these networks, mathematical and computational modeling is required. We propose a computational modeling framework in order to achieve more robust discoveries in the context of logical signaling networks. More precisely, we focus on modeling the response of logical signaling networks by means of automated reasoning using Answer Set Programming (ASP). ASP provides a declarative language for modeling various knowledge representation and reasoning problems. Moreover, available ASP solvers provide several reasoning modes for assessing the multitude of answer sets. Therefore, leveraging its rich modeling language and its highly efficient solving capacities, we use ASP to address three challenging problems in the context of logical signaling networks: learning of (Boolean) logical networks, experimental design, and identification of intervention strategies. Overall, the contribution of this thesis is three-fold. Firstly, we introduce a mathematical framework for characterizing and reasoning on the response of logical signaling networks. Secondly, we contribute to a growing list of successful applications of ASP in systems biology. Thirdly, we present a software providing a complete pipeline for automated reasoning on the response of logical signaling networks.
Deciphering the functioning of biological networks is one of the central tasks in systems biology. In particular, signal transduction networks are crucial for the understanding of the cellular response to external and internal perturbations. Importantly, in order to cope with the complexity of these networks, mathematical and computational modeling is required. We propose a computational modeling framework in order to achieve more robust discoveries in the context of logical signaling networks. More precisely, we focus on modeling the response of logical signaling networks by means of automated reasoning using Answer Set Programming (ASP). ASP provides a declarative language for modeling various knowledge representation and reasoning problems. Moreover, available ASP solvers provide several reasoning modes for assessing the multitude of answer sets. Therefore, leveraging its rich modeling language and its highly efficient solving capacities, we use ASP to address three challenging problems in the context of logical signaling networks: learning of (Boolean) logical networks, experimental design, and identification of intervention strategies. Overall, the contribution of this thesis is three-fold. Firstly, we introduce a mathematical framework for characterizing and reasoning on the response of logical signaling networks. Secondly, we contribute to a growing list of successful applications of ASP in systems biology. Thirdly, we present a software providing a complete pipeline for automated reasoning on the response of logical signaling networks.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Dias, M. G. "Logical reasoning." Thesis, University of Oxford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233533.

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

Andersson, Robin. "Implementation av ett kunskapsbas system för rough set theory med kvantitativa mätningar." Thesis, Linköping University, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1756.

Повний текст джерела
Анотація:

This thesis presents the implementation of a knowledge base system for rough sets [Paw92]within the logic programming framework. The combination of rough set theory with logic programming is a novel approach. The presented implementation serves as a prototype system for the ideas presented in [VDM03a, VDM03b]. The system is available at "http://www.ida.liu.se/rkbs".

The presented language for describing knowledge in the rough knowledge base caters for implicit definition of rough sets by combining different regions (e.g. upper approximation, lower approximation, boundary) of other defined rough sets. The rough knowledge base system also provides methods for querying the knowledge base and methods for computing quantitative measures.

We test the implemented system on a medium sized application example to illustrate the usefulness of the system and the incorporated language. We also provide performance measurements of the system.

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

Leevers, Hilary Janet. "Children's logical reasoning." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362050.

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

Kouri, Teresa. "Logical Instrumentalism." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1472751856.

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

Carbin, Michael (Michael James). "Logical reasoning for approximate and unreliable computation." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99813.

Повний текст джерела
Анотація:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 343-350).
Improving program performance and resilience are long-standing goals. Traditional approaches include a variety of transformation, compilation, and runtime techniques that share the common property that the resulting program has the same semantics as the original program. However, researchers have recently proposed a variety of new techniques that set aside this traditional restriction and instead exploit opportunities to change the semantics of programs to improve performance and resilience. Techniques include skipping portions of a program's computation, selecting different implementations of program's subcomputations, executing programs on unreliable hardware, and synthesizing values to enable programs to skip or execute through otherwise fatal errors. A major barrier to the acceptance these techniques in both the broader research community and in industrial practice is the challenge that the resulting programs may exhibit behaviors that differ from that of the original program, potentially jeopardizing the program's resilience, safety, and accuracy. This thesis presents the first general programming systems for precisely verifying and reasoning about the programs that result from these techniques. This thesis presents a programming language and program logic for verifying worst-case properties of a transformed program. Specifically the framework, enables verifying that a transformed program satisfies important assertions about its safety (e.g., that it does not access invalid memory) and accuracy (e.g., that it returns a result within a bounded distance of that of the original program). This thesis also presents a programming language and automated analysis for verifying a program's quantitative reliability - the probability the transformed program returns the same result as the original program - when executed on unreliable hardware. The results of this thesis, which include programming languages, program logics, program analysis, and applications thereof, present the first steps toward reaping the benefits of changing the semantics of programs in a beneficial yet principled way.
by Michael James Carbin.
Ph. D.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Romo, Maria Susanna 1968. "Cultural differences in memory and logical reasoning." Thesis, The University of Arizona, 1995. http://hdl.handle.net/10150/291706.

Повний текст джерела
Анотація:
The focus of this study was to manipulate factors to determine whether mental representations of logical problems differed by culture. The cultural differences hypothesis suggests that Anglo students would be more likely to have a linear representation (e.g. arranging objects that differ in a "line" mentally) whereas Hispanic and Native American students would have a nonlinear (pivot) organization. The results indicated that Hispanic children solved questions better if they appeared in a pivotal format, whereas, Native American and Anglo children performed better if the stimuli were presented in a linear method. With grade level, Hispanic children shifted to the linear format and Anglo and Native American children improved upon the pivot presentation. This suggests that there may be differences in mental representations of objects for Hispanic children that is influenced by acculturation.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Rajaratnam, David Computer Science &amp Engineering Faculty of Engineering UNSW. "Logical approximation and compilation for resource-bounded reasoning." Publisher:University of New South Wales. Computer Science & Engineering, 2008. http://handle.unsw.edu.au/1959.4/41296.

Повний текст джерела
Анотація:
Providing a logical characterisation of rational agent reasoning has been a long standing challenge in artificial intelligence (AI) research. It is a challenge that is not only of interest for the construction of AI agents, but is of equal importance in the modelling of agent behaviour. The goal of this thesis is to contribute to the formalisation of agent reasoning by showing that the computational limitations of agents is a vital component of modelling rational behaviour. To achieve this aim, both motivational and formal aspects of resource-bounded agents are examined. It is a central argument of this thesis that accounting for computational limitations is critical to the success of agent reasoning, yet has received only limited attention from the broader research community. Consequently, an important contribution of this thesis is in its advancing of motivational arguments in support of the need to account for computational limitations in agent reasoning research. As a natural progression from the motivational arguments, the majority of this thesis is devoted to an examination of propositional approximate logics. These logics represent a step towards the development of resource-bounded agents, but are also applicable to other areas of automated reasoning. This thesis makes a number of contributions in mapping the space of approximate logics. In particular, it draws a connection between approximate logics and knowledge compilation, by developing an approximate knowledge compilation method based on Cadoli and Schaerf??s S-3 family of approximate logics. This method allows for the incremental compilation of a knowledge base, thus reducing the need for a costly recompilation process. Furthermore, each approximate compilation has well-defined logical properties due to its correspondence to a particular S-3 logic. Important contributions are also made in the examination of approximate logics for clausal reasoning. Clausal reasoning is of particular interest due to the efficiency of modern clausal satisfiability solvers and the related research into problem hardness. In particular, Finger's Logics of Limited Bivalence are shown to be applicable to clausal reasoning. This is subsequently shown to logically characterise the behaviour of the well-known DPLL algorithm for determining boolean satisfiability, when subjected to restricted branching.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Bennett, Brandon. "Logical representations for automated reasoning about spatial relationships." Thesis, University of Leeds, 1997. http://etheses.whiterose.ac.uk/1271/.

Повний текст джерела
Анотація:
This thesis investigates logical representations for describing and reasoning about spatial situations. Previously proposed theories of spatial regions are investigated in some detail - especially the 1st-order theory of Randell, Cui and Cohn (1992). The difficulty of achieving effective automated reasoning with these systems is observed. A new approach is presented, based on encoding spatial relations in formulae of 0-order ('propositional') logics. It is proved that entailment, which is valid according to the standard semantics for these logics, is also valid with respect to the spatial interpretation. Consequently, well-known mechanisms for propositional reasoning can be applied to spatial reasoning. Specific encodings of topological relations into both the modal logic S4 and the intuitionistic propositional calculus are given. The complexity of reasoning using the intuitionistic representation is examined and a procedure is presented with is shown to be of O(n3) complexity in the number of relations involved. In order to make this kind of representation sufficiently expressive the concepts of model constraint and entailment constraint are introduced. By means of this distinction a 0-order formula may be used either to assert or to deny that a certain spatial constraint holds of some situation. It is shown how the proof theory of a 0-order logical language can be extended by a simple meta-level generalisation to accommodate a representation involving these two types of formula. A number of other topics are dealt with: a decision procedure based on quantifier elimination is given for a large class of formulae within a 1st-order topological language; reasoning mechanisms based on the composition of spatial relations are studied; the non-topological property of convexity is examined both from the point of view of its 1st-order characterisation and its incorporation into a 0-order spatial logic. It is suggested that 0-order representations could be employed in a similar manner to encode other spatial concepts.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Caruso, Matteo. "On logical quantitative methods in politics." Thesis, IMT Alti Studi Lucca, 2021. http://e-theses.imtlucca.it/337/1/Caruso_phdthesis.pdf.

Повний текст джерела
Анотація:
The first chapter introduces the methodology of logical quantitative models and its applications to political sciences. The second chapter explains the conversion of votes to seats. I use the law of minority attrition, expanding its form into a final model which is applicable from single member district to several electoral systems. The third chapter introduces the estimation of party seats from the previous elections using a weighted regression with independent variables jointly: 1) the product of the assembly size and the district magnitude, 2) the past values of the biggest party shares, and 3) the number of Effective parties and simply considered. Chapter four develops a probability density function with five inflection points which describes any party system. It better catches the asymmetries among the party seats distribution at nationwide level. Chapter five implements the Downsian (or positional) competition model that describes the left-right space occupied by each party through Beta functions that I have tested on the Italian elections from 1992 to 2018. Chapter six presents an in-depth qualitative analysis of the hypothesis that the more proportional an electoral system, the more the parties tend to centripetal competition, thus connecting ideological terms, effective number of parties and electoral system. In chapter seven, I suggest an alternative logical method to aggregate electoral flows, which resolves Goodman’s problematics and provides a simpler solution than that of G. King. Chapter eight provides tools to more accurately calculate the optimal value of S (Taagepera and Shugart, 1989, p. 175), and unprecedently, the optimal value of other institutional variables such as: the district magnitude, the Gallagher’s index of dis-representation, and the dis-representation index attributable to an electoral system (De), originally developed in this thesis. Chapter nine wants to determine an equilibrium between parties’ and voters’ “electoral utility”, which is the quantity of dis-representation which benefits a group of parties and voters in the system, producing disutility for the others; this chapter enriches the law of minority attrition including thresholds and majority premiums (MJPs) and strategic vote, using a primary game theory approach and the "Maximin" Rawlsian theory (1971) as a benchmark for equality. Chapter ten provides an overview of links among the new tools and knowledge developed in this thesis, with the final aim of the normative building of an optimal electoral system, which can warrant both logical coherence and social equity as categorized by Arrow (1951).
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Quantitative and logical reasoning"

1

International Joint Conference on Qualitative and Quantitative Practical Reasoning (1st 1997 Bad Honnef, Germany). Qualitative and quantitative practical reasoning: First International Joint Conference on Qualitative and Quantitative Practical Reasoning, ECSQARU-FAPR '97 : Bad Honnef, Germany, June 9-12, 1997 : proceedings. Berlin: Springer, 1997.

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

Council, Law School Admission, and Law School Admission Services (U.S.), eds. Logical reasoning workbook. Newton, Pa: Law Services, 1990.

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

Liu, Weiru. Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 11th European Conference, ECSQARU 2011, Belfast, UK, June 29–July 1, 2011. Proceedings. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.

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

Claudio, Sossai, and Chemello Gaetano, eds. Symbolic and quantitative approaches to reasoning with uncertainty: 10th European conference, ECSQARU 2009, Verona, Italy, July 1-3, 2009 ; proceedings. Berlin: Springer, 2009.

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

1956-, Allwein Gerard, and Barwise Jon, eds. Logical reasoning with diagrams. New York: Oxford University Press, 1996.

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

Logical reasoning in science & technology. Toronto: J. Wiley & Sons Canada, 1991.

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

F, Strawson P. Introduction to logical theory. London: Methuen, 1991.

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

Wainman, Grant. Cognitive & logical consistency in syllogistic reasoning. Sudbury, Ont: Laurentian University, Department of Psychology, 1995.

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

Kiersky, James Hugh. Thinking critically: Techniques for logical reasoning. Minneapolis/St. Paul: West Pub. Co., 1995.

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

Legal reasoning: Semantic and logical analysis. New York: P. Lang, 1985.

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

Частини книг з теми "Quantitative and logical reasoning"

1

Finger, Marcelo. "Quantitative Logic Reasoning." In Trends in Logic, 241–71. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98797-2_12.

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

Demolombe, Robert, Andrew J. I. Jones, and Jose Carmo. "Toward a uniform logical representation of different kinds of integrity constraints." In Qualitative and Quantitative Practical Reasoning, 614–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035653.

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

Saad, Emad. "A Logical Approach to Qualitative and Quantitative Reasoning." In Lecture Notes in Computer Science, 173–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-75256-1_18.

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

Wilson, Nic, and Jérôme Mengin. "Logical Deduction using the Local Computation Framework." In Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 386–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48747-6_36.

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

Slaney, John, and Robert Meyer. "Logic for two: The semantics of distributive substructural logics." In Qualitative and Quantitative Practical Reasoning, 554–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035648.

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

Loreti, Michele, and Aniqa Rehman. "A Logical Framework for Reasoning About Local and Global Properties of Collective Systems." In Quantitative Evaluation of Systems, 133–49. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-16336-4_7.

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

Weydert, Emil. "Rational Default Quantifier Logic." In Qualitative and Quantitative Practical Reasoning, 589–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035651.

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

Besnard, Philippe, Jean-Marc Guinnebault, and Emmanuel Mayer. "Propositional quantification for conditional logic." In Qualitative and Quantitative Practical Reasoning, 183–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035622.

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

Hunter, Anthony. "Using default logic for lexical knowledge." In Qualitative and Quantitative Practical Reasoning, 322–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035632.

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

Kern-Isberner, Gabriele. "A logically sound method for uncertain reasoning with quantified conditionals." In Qualitative and Quantitative Practical Reasoning, 365–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035635.

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

Тези доповідей конференцій з теми "Quantitative and logical reasoning"

1

Mardare, Radu, Prakash Panangaden, and Gordon Plotkin. "Quantitative Algebraic Reasoning." In LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933575.2934518.

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

Maubert, Bastien, Munyque Mittelmann, Aniello Murano, and Laurent Perrussel. "Strategic Reasoning in Automated Mechanism Design." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/46.

Повний текст джерела
Анотація:
Mechanism Design aims at defining mechanisms that satisfy a predefined set of properties, and Auction Mechanisms are of foremost importance. Core properties of mechanisms, such as strategy-proofness or budget-balance, involve: (i) complex strategic concepts such as Nash equilibria, (ii) quantitative aspects such as utilities, and often (iii) imperfect information,with agents’ private valuations. We demonstrate that Strategy Logic provides a formal framework fit to model mechanisms, express such properties, and verify them. To do so, we consider a quantitative and epistemic variant of Strategy Logic. We first show how to express the implementation of social choice functions. Second, we show how fundamental mechanism properties can be expressed as logical formulas,and thus evaluated by model checking. Finally, we prove that model checking for this particular variant of Strategy Logic can be done in polynomial space.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Hoffmann, Jan, Michael Marmar, and Zhong Shao. "Quantitative Reasoning for Proving Lock-Freedom." In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.18.

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

Bouyer, Patricia, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, and Giuseppe Perelli. "Reasoning about Quality and Fuzziness of Strategic Behaviours." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/220.

Повний текст джерела
Анотація:
We introduce and study SL[F], a quantitative extension of SL (Strategy Logic), one of the most natural and expressive logics describing strategic behaviours. The satisfaction value of an SL[F] formula is a real value in [0,1], reflecting ``how much'' or ``how well'' the strategic on-going objectives of the underlying agents are satisfied. We demonstrate the applications of SL[F] in quantitative reasoning about multi-agent systems, by showing how it can express concepts of stability in multi-agent systems, and how it generalises some fuzzy temporal logics. We also provide a model-checking algorithm for ourlogic, based on a quantitative extension of Quantified CTL*.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Mio, Matteo, Ralph Sarkis, and Valeria Vignudelli. "Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning." In LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3531130.3533366.

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

Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. "Quantitative Claim-Centric Reasoning in Logic-Based Argumentation." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/377.

Повний текст джерела
Анотація:
Argumentation is a well-established formalism for nonmonotonic reasoning, with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms support for a claim if it is consistent, subset-minimal, and implies the claim. Then, an argument comprises support and a claim. We observe that the computational task (ARG) of asking for support of a claim in a knowledge base is “brave”, since many claims with a single support are accepted. As a result, ARG falls short when it comes to the question of confidence in a claim, or claim strength. In this paper, we propose a concept for measuring the (acceptance) strength of claims, based on counting supports for a claim. Further, we settle classical and structural complexity of counting arguments favoring a given claim in propositional knowledge bases (KBs). We introduce quantitative reasoning to measure the strength of claims in a KB and to determine the relevance strength of a formula for a claim.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gavazzo, Francesco. "Quantitative Behavioural Reasoning for Higher-order Effectful Programs." In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3209108.3209149.

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

Besin, Viktor, Markus Hecher, and Stefan Woltran. "Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract)." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/732.

Повний текст джерела
Анотація:
Extending the popular Answer Set Programming (ASP) paradigm by introspective reasoning capacities has received increasing interest within the last years. Particular attention is given to the formalism of epistemic logic programs (ELPs) where standard rules are equipped with modal operators which allow to express conditions on literals for being known or possible, i.e., contained in all or some answer sets, respectively. ELPs thus deliver multiple collections of answer sets, known as world views. Employing ELPs for reasoning problems so far has mainly been restricted to standard deci- sion problems (complexity analysis) and enumeration (development of systems) of world views. In this paper, we first establish quantitative reasoning for ELPs, where the acceptance of a certain set of literals depends on the number (proportion) of world views that are compatible with the set. Second, we present a novel system capable of efficiently solving the underlying counting problems required for quantitative reasoning. Our system exploits the graph-based measure treewidth by iteratively finding (graph) abstractions of ELPs.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Chowdhury, Ahmed, Lakshmi N. A. Venkatanarasimhan, and Chiradeep Sen. "A Formal Representation of Conjugate Verbs in Function Modeling." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22630.

Повний текст джерела
Анотація:
Abstract Many modern and innovative design problems require multi-modal, reconfigurable solutions. Function modeling is a common tool used to explore solutions in early stages of mechanical engineering design. Currently, function structure representations do not support the modeling of formally-defined reconfigurable function models. There is a well-established need in function modeling to dynamically capture the effects of state change of a flow property on the operating mode of the system. This paper presents a formal representation to capture the duality of specific functions, and illustrates it through three verbs that shift from one mode of operation to its logical and topological opposite, based on the existence of, or the value of a signal from, an input flow. Additionally, an approach to extend these functions to function features, in order to support physics-based reasoning on the interactions between flows is also presented. Through the example of a system-level model of a geothermal heat pump operating in its heating mode, the representation demonstrates the ability to support causal reasoning on functional modes of systems, provides quantitative reasoning on the efficiency of those modes, and illustrates the modeling efficacy of the extended representation.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Charalambidis, Angelos, George Papadimitriou, Panos Rondogiannis, and Antonis Troumpoukis. "A Many-valued Logic for Lexicographic Preference Representation." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/62.

Повний текст джерела
Анотація:
We introduce lexicographic logic, an extension of propositional logic that can represent a variety of preferences, most notably lexicographic ones. The proposed logic supports a simple new connective whose semantics can be defined in terms of finite lists of truth values. We demonstrate that, despite the well-known theoretical limitations that pose barriers to the quantitative representation of lexicographic preferences, there exists a subset of the rational numbers over which the proposed new connective can be naturally defined. Lexicographic logic can be used to define in a simple way some well-known preferential operators, like "A and if possible B", and "A or failing that B". We argue that the new logic is an effective formalism for ranking query results according to the satisfaction level of user preferences.
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Quantitative and logical reasoning"

1

Driesen, Jacob. Differential Effects of Visual and Auditory Presentation on Logical Reasoning. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.2546.

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

Varela, Carlos A. Stochastic Quantitative Reasoning for Autonomous Mission Planning. Fort Belvoir, VA: Defense Technical Information Center, April 2014. http://dx.doi.org/10.21236/ada599522.

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

Lutz, Carsten. NExpTime-complete Description Logics with Concrete Domains. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.104.

Повний текст джерела
Анотація:
Aus der Einleitung: Description logics (DLs) are a family of logical formalisms well-suited for the representation of and reasoning about conceptual knowledge on an abstract logical level. However, for many knowledge representation applications, it is essential to integrate the abstract logical knowledge with knowledge of a more concrete nature. As an example, consider the modeling of manufacturing processes, where it is necessary to represent 'abstract' entities like subprocesses and workpieces and also 'concrete' knowledge, e.g., about the duration of processes and physical dimensions of the manufactured objects [2; 25].
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Lutz, Carsten. TheComplexity of Reasoning with Concrete Domains (Revised Version). Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.88.

Повний текст джерела
Анотація:
Description logics are knowledge representation and reasoning formalisms which represent conceptual knowledge on an abstract logical level. Concrete domains are a theoretically well-founded approach to the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals or spatial regions. In this paper, the complexity of combined reasoning with description logcis and on concrete domains is investigated. We extend ALC(D), which is the basic description logic for reasoning with concrete domains, by the operators 'feature agreement' and 'feature disagreement'. For the extended logic,called ALCF(D), an algorithm for deciding the ABox consistency problem is devised. The strategy employed by this algorithm is vital for the efficient implementation of reasoners for description logics incorporating concrete domains. Based on the algorithm, it is proved that the standard reasoning problems for both logics ALC(D) and ALCF(D) are PSpace-complete - provided that the satisfiability test of the concrete domain used is in PSpace.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ahn, Ki Yung. The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.2086.

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

Borgwardt, Stefan, Marco Cerami, and Rafael Peñaloza. Subsumption in Finitely Valued Fuzzy EL. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.212.

Повний текст джерела
Анотація:
Aus der Einleitung: Description Logics (DLs) are a family of knowledge representation formalisms that are successfully applied in many application domains. They provide the logical foundation for the Direct Semantics of the standard web ontology language OWL2. The light-weight DL EL, underlying the OWL2 EL profile, is of particular interest since all common reasoning problems are polynomial in this logic, and it is used in many prominent biomedical ontologies like SNOMEDCT and the Gene Ontology.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Támola, Alejandro, and María Carmen Fernández Díez. Initial Conditions for Economic Recovery after COVID-19: A Logical and Quantitative Framework for Latin American and Caribbean Countries. Inter-American Development Bank, August 2020. http://dx.doi.org/10.18235/0002628.

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

Lutz, Carsten, Carlos Areces, Ian Horrocks, and Ulrike Sattler. Keys, Nominals, and Concrete Domains. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.122.

Повний текст джерела
Анотація:
Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to 'concrete' domains such as numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be quite useful for reasoning about conceptual models of information systems, and as the basis for expressive ontology languages. We propose to further extend such DLs with key constraints that allow the expression of statements like 'US citizens are uniquely identified by their social security number'. Based on this idea, we introduce a number of natural description logics and perform a detailed analysis of their decidability and computational complexity. It turns out that naive extensions with key constraints easily lead to undecidability, whereas more careful extensions yield NEXPTIME-complete DLs for a variety of useful concrete domains.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Camilo, Cláudia, Andréia Salmazo, Margari da Vaz Garrido, and Maria Manuela Calheiros. Parents’ executive functioning in parenting outcomes: A meta-analytic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, March 2023. http://dx.doi.org/10.37766/inplasy2023.3.0067.

Повний текст джерела
Анотація:
Review question / Objective: Guided by the PRISMA guidelines, this study aims to systematically review and meta-analyze the literature exploring the association between parents’ basic and higher-order executive functions in adulthood (working memory, inhibitory control, cognitive flexibility, planning, reasoning, problem-solving) and positive and negative parenting outcomes (parenting practices, behaviors, styles). Eligibility criteria: his meta-analysis will include: 1) Studies that analyze the association of mothers’/ fathers’ basic and higher-order executive functions in adulthood and parenting outcomes (e.g., parental styles, behaviors, quality of interaction, abusive or violent practices); 2) Quantitative empirical studies (correlational, longitudinal, and group comparison designs); 3) Peer-reviewed articles or dissertations, published in English, Spanish, or Portuguese. The exclusion criteria are: 1) Studies analyzing children’s executive functions; 2) Studies analyzing children’s developmental outcomes; 3) Studies not focusing on parenting outcomes; 4) Qualitative studies, and non-empirical studies such as theoretical reviews, systematic reviews, or meta-analyses.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Quantitative and logical reasoning" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

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