Academic literature on the topic 'Logical tasks'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Logical tasks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Logical tasks"
1
Taiboldina, K. R., K. R. Ramazanova, and G. R. Churbaeva. "LOGICAL TASKS." Vestnik of M. Kozybayev North Kazakhstan University, no. 2 (51) (December 29, 2021): 34–38. http://dx.doi.org/10.54596/2309-6977-2021-2-34-38.
Full textAbstract:
This article discusses non-standard logical problems encountered in the mathematical Olympiad and methods of their solution. Special attention is paid to familiarization with the ways of solving logical problems and the peculiarities of teaching this topic. Forming the skills of solving logical problems, we develop in the student the qualities of curiosity, perseverance, versatility. The main purpose of setting logical problems at the Mathematical Olympiad is the independent solution of problems and the development of students' curiosity.At the mathematical Olympiad, it is rather more difficult for schoolchildren to solve logical problems. Therefore, a professionally qualified teacher should be able to teach his students effective methods of solving problems.
2
Pulatova, Manzura Iskhakovna, and Zilola Kahramonovna Khamroeva. "METHODS FOR SOLVING LOGICAL PROBLEMS FOR THE DEVELOPMENT OF THE MIND IN MATHEMATICS." GOLDEN BRAIN 1, no. 11 (2023): 68–75. https://doi.org/10.5281/zenodo.7865623.
Full textAbstract:
<em>Whatever the type of learning activity, it is the "tasks" that engage the student and encourage him to think. The ability to recall and apply new knowledge in various learning processes, to generalize and assimilate the acquired knowledge is directly related to learning tasks, and tasks are a means of developing the student’s knowledge (these ideas are not copied from anywhere). I came to this conclusion by observing students when I was in schools for experimental testing and work with teachers. Indeed, in order to gain new knowledge, the student uses his previous knowledge, applies and reinforces the acquired knowledge with examples and tasks.</em>
3
Sapazhanov, Y., Y. Sapazhanov, T. Manap, and K. Uderbayeva. "DEVELOPING STUDENTS’ LOGICAL THINKING BY SOLVING NON-STANDARD TASKS." Педагогика и Методы Обучения, no. 3 (56) 2021 (September 15, 2021): 75–83. https://doi.org/10.47344/sdu20bulletin.v56i3.601.
Full textAbstract:
One of the priority tasks of the modern education system is the formation of a logically thinking, research-oriented personality. The ability to think logically is a necessary condition for the successful assimilation of educational material. The article deals with the use of various non-standard tasks for this purpose, which forces us to abandon the stereotypes of thinking. The paper considers some pedagogical conditions that must be followed when learning to solve non-standard problems, and partially reveals the work at the stages of their solution. However, it should be noted that when learning to solve non-standard tasks, you can and should follow the same pedagogical conditions as when working with standard tasks. The article also deals with the development of logical thinking in the process of teaching mathematics. The key point of studying this problem is the study of the levels of logical thinking: the identification of cause-and-effect relationships, the formation of mental operations in the course of solving non-standard problems.
4
Ibragimov, R., B. Kalimbetov, and Zh Khabibullaev. "Features of Preparing Future Mathematics Teachers for the Implementation of Logical Tasks." Iasaýı ýnıversıtetіnіń habarshysy 129, no. 3 (2023): 239–52. http://dx.doi.org/10.47526/2023-3/2664-0686.18.
Full textAbstract:
This article describes the types of logical tasks in Mathematics textbooks of the main school according to the updated program and the characteristic features of the methodological training of future mathematics teachers in their implementation. The issue of preparing students for the implementation of logical tasks is considered. Methods and techniques for improving the logical thinking of students studying in the specialty of a mathematics teacher are outlined. The main task of teaching mathematics is the development of logical thinking and logical training of students. Accounting in the ability to think logically, along with the interest of a student who comes to school, is the main task of a mathematics teacher. Therefore, it is necessary to train future teachers of mathematics as young specialists capable of developing logical literacy of students using effective teaching technologies. This leads to the need to increase the requirements for the quality of teaching students in general schools and, accordingly, the quality of training of future teachers in pedagogical universities. However, only supplementing the process of training students with new content, increasing the amount of knowledge communicated to students is not able to solve the task of raising the quality of teacher training to the level of modern requirements. The solution to this problem, in our opinion, lies in the systematization of fundamental training of future teachers, should be logical training that allows students to be confident in critical thinking, analysis, reasoning and reasoning, maintain and justify their point of view.
5
Ontuganova, Sh Sh, and A. Zhapbarov. "FORMATION OF LOGICAL THINKING AND SPEECH SKILLS OF ELEMENTARY CLASS STUDENTS." Bulletin of Kazakh National Women's Teacher Training University, no. 2 (July 16, 2021): 31–41. http://dx.doi.org/10.52512/2306-5079-2021-86-2-31-41.
Full textAbstract:
Only with logically correct thinking and understanding, we distinguish between cause-and-effect relationships, dependence on each other, the origin and path of development of things around us. The process of logically correct thinking expands the student's ability to treat his assumptions skeptically and critically, thereby deepening and expanding his understanding of the world, existence and being. The logical process is the result of scientific knowledge of the world, memorization of objects and phenomena of the external world in the human brain, consideration of the correct forms and laws, rules of this image. Logical methods of thinking cannot be formed independently from the day children come to school, for this the teacher must lay the foundations of logical knowledge and skills. It is necessary to work out the material, describing each action taking into account the age capabilities of children, hence the use of a large number of logical tasks in teaching is an important factor in quality learning. And the assimilation of logical techniques, forms of thinking, concepts, judgments to primary school students by conclusions is provided by the primary school program. This article discusses the pedagogical prerequisites for performing a system of tasks in the main subjects of primary school as a way of forming logical thinking skills of younger schoolchildren, skills and means of practical study of logical concepts.
6
Kozyriev, Andrii, and Ihor Shubin. "The method of linear-logical operators and logical equations in information extraction tasks." INNOVATIVE TECHNOLOGIES AND SCIENTIFIC SOLUTIONS FOR INDUSTRIES, no. 1 (27) (July 2, 2024): 81–95. http://dx.doi.org/10.30837/itssi.2024.27.081.
Full textAbstract:
Relational and logical methods of knowledge representation play a key role in creating a mathematical basis for information systems. Predicate algebra and predicate operators are among the most effective tools for describing information in detail. These tools make it easy to formulate formalized information, create database queries, and simulate human activity. In the context of the new need for reliable and efficient data selection, a problem arises in deeper analysis. Subject of the study is the theory of quantum linear equations based on the algebra of linear predicate operations, the formal apparatus of linear logic operators and methods for solving logical equations in information extraction tasks. Aim of the study is a developing of a method for using linear logic operators and logical equations to extract information. This approach can significantly optimize the process of extracting the necessary information, even in huge databases. Main tasks: analysis of existing approaches to information extraction; consideration of the theory of linear logic operators; study of methods for reducing logic to an algebraic form; analysis of logical spaces and the algebra of finite predicate actions and the theory of linear logic operators. The research methods involve a systematic analysis of the mathematical structure of the algebra of finite predicates and predicate functions to identify the key elements that affect the query formation process. The method of using linear logic operators and logical equations for information extraction is proposed. The results of the study showed that the method of using linear logic operators and logical equations is a universal and adaptive tool for working with algebraic data structures. It can be applied in a wide range of information extraction tasks and prove its value as one of the possible methods of information processing. Conclusion. The paper investigates formal methods of intelligent systems, in particular, ways of representing knowledge in accordance with the peculiarities of the field of application and the language that allows encoding this knowledge for storage in computer memory. The proposed method can be implemented in the development of language interfaces for automated information access systems, in search engine algorithms, for logical analysis of information in databases and expert systems, as well as in performing tasks related to object recognition and classification.
7
De Neys, Wim. "The freak in all of us: Logical truth seeking without argumentation." Behavioral and Brain Sciences 34, no. 2 (2011): 75–76. http://dx.doi.org/10.1017/s0140525x10002827.
Full textAbstract:
AbstractMercier and Sperber (M&S) sketch a bleak picture of logical reasoning in classic, nonargumentative tasks. I argue that recent processing data indicate that despite people's poor performance they at least seek to adhere to traditional logical norms in these tasks. This implies that classic reasoning tasks are less artificial–and logical reasoning less exceptional–than M&S's framework suggests.
8
Fakhertdinova1, D. I., and A. L. Zolkin. "LOGICAL-FORMING TASKS IN THE DEVELOPMENT OF LOGICAL COMPETENCE OF IT FOREIGN APPLICANTS." Izvestiya of the Samara Science Centre of the Russian Academy of Sciences. Social, Humanitarian, Medicobiological Sciences 25, no. 90 (2023): 47–53. http://dx.doi.org/10.37313/2413-9645-2023-25-90-47-53.
Full textAbstract:
The article introduces the definition logical competence of the context of future IT professionals. The difference between existing approaches to the definition of logical competence and logical competences is considered. The importance of logical competence as a main competence on the formation and development of the professional competence of future IT specialists is presented. Difficulties in the process of formation and development of logical competence and ways to solve them are described. An overview of various educational systems of the world aimed at the formation of the logical competence of applicants for IT areas is presented. Also, the difficulties arising in the development of logical competence among foreign applicants of future IT specialists in Russian universities are considered. Despite the seemingly obvious problem of insufficient knowledge of the Russian language for learning, the main difficulty is the difference in programs and methods of learning in different countries. If the Russian educational system in the training of future IT specialists attaches great importance to the fundamental serious mathematical base, then even the best IT education systems in various countries focus on the applied part of disciplines. As you know, in the development of any kind of competencies, the foundation, the basic subjects on the basis of which the competencies are formed, is of paramount importance. The article describes tasks that form and develop the logical competence of applicants for future IT specialists. The proposed definition of logical competence, as well as the ways of its formation and development among applicants for IT areas, can be extended to other technical areas with appropriate refinement and recommended for work with applicants or undergraduate students.
9
Bronkhorst, Hugo, Gerrit Roorda, Cor Suhre, and Martin Goedhart. "Logical Reasoning in Formal and Everyday Reasoning Tasks." International Journal of Science and Mathematics Education 18, no. 8 (2019): 1673–94. http://dx.doi.org/10.1007/s10763-019-10039-8.
Full textAbstract:
AbstractLogical reasoning is of great societal importance and, as stressed by the twenty-first century skills framework, also seen as a key aspect for the development of critical thinking. This study aims at exploring secondary school students’ logical reasoning strategies in formal reasoning and everyday reasoning tasks. With task-based interviews among 4 16- and 17-year-old pre-university students, we explored their reasoning strategies and the reasoning difficulties they encounter. In this article, we present results from linear ordering tasks, tasks with invalid syllogisms and a task with implicit reasoning in a newspaper article. The linear ordering tasks and the tasks with invalid syllogisms are presented formally (with symbols) and non-formally in ordinary language (without symbols). In tasks that were familiar to our students, they used rule-based reasoning strategies and provided correct answers although their initial interpretation differed. In tasks that were unfamiliar to our students, they almost always used informal interpretations and their answers were influenced by their own knowledge. When working on the newspaper article task, the students did not use strong formal schemes, which could have provided a clear overview. At the end of the article, we present a scheme showing which reasoning strategies are used by students in different types of tasks. This scheme might increase teachers’ awareness of the variety in reasoning strategies and can guide classroom discourse during courses on logical reasoning. We suggest that using suitable formalisations and visualisations might structure and improve students’ reasoning as well.
10
Prokhorova, Tatiana Pavlovna. "The logical question as a method of development logical universal educational actions." KANT 40, no. 3 (2021): 280–84. http://dx.doi.org/10.24923/2222-243x.2021-40.53.
Full textAbstract:
The purpose of the study is to determine the actual problems of the formation and further development of logical universal educational actions and historical thinking of schoolchildren. The article emphasis is placed on the problems of teaching school students the subject "History" at the initial stage, including the problem of forming historical thinking, and the directions for solving them. The thesis is argued that one of the most effective methods of forming and development logical universal educational actions, and therefore the possibility of forming historical thinking, are logical tasks. The scientific novelty of the study lies in the formation of a new approach to the development of logical universal educational actions through the methodology of constructing logical questions as a type of logical tasks. As a result of the study, the practice-oriented conditions of the organization of the pedagogical process were identified and an author's model of teacher's work for different age groups is offered.
Dissertations / Theses on the topic "Logical tasks"
1
Zhao, Yingshen. "An ontology-based approach towards coupling task and path planning for the simulation of manipulation tasks." Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0065.
Full textAbstract:
Ce travail traite de la simulation et de la validation de tâches de manipulation complexes sous de fortes contraintes géométriques dans des environnements virtuels. Les applications visées sont liées au Framework industriel 4.0 ; à mesure que les produits s’intègrent de plus en plus et que la concurrence économique s'intensifie, les industriels expriment le besoin de valider, dès la conception, non seulement les modèles CAO statiques de leurs produits mais aussi les tâches (ex. : assemblage ou maintenance) liées à leur Product Lifecycle Management (PLM). La communauté scientifique s'est penchée sur cette question sous deux angles : - La planification des tâches décompose une tâche de manipulation à réaliser en une séquence d'actions primitives (c.-à-d. un plan de tâches). - La planification de trajectoire calcule des trajectoires sans collision, notamment pour les objets manipulés. Elle utilise traditionnellement des données purement géométriques, ce qui conduit à des limitations classiques. Les approches conjointes de planification des tâches et des trajectoires que l'on trouve dans la littérature effectuent habituellement une étape classique de planification des tâches, puis vérifient la faisabilité des demandes de planification de trajectoire associées aux actions primitives de ce plan de tâches. Le lien entre la planification des tâches et des trajectoires doit être amélioré, notamment en raison de l'absence de bouclage entre le niveau de planification des trajectoires et le niveau de planification des tâches : - L'information de planification de trajectoire utilisée pour remettre en question le plan de tâches se limite habituellement à la faisabilité du mouvement lorsqu'une information plus riche telle que la pertinence ou la complexité de la trajectoire proposée serait nécessaire ; - Les requêtes de planification de trajectoire utilisent traditionnellement des données purement géométriques et/ou des méthodes de planification de trajectoire "aveugles" (par exemple, RRT), et aucune information liée aux tâches n'est utilisée au niveau de la planification de trajectoire. Notre travail se concentre sur l'utilisation de l'information au niveau des tâches au niveau de la planification de la trajectoire. L'algorithme de planification de trajectoire RRT est considéré, parce que nous considérons la simulation de tâches complexes sous fortes contraintes géométriques. Nous proposons une approche basée sur l'ontologie pour utiliser les informations au niveau des tâches afin de spécifier les requêtes de planification de trajectoire pour les actions primitives d'un plan de tâches. Tout d'abord, nous proposons une ontologie pour conceptualiser les connaissances sur l'environnement 3D dans lequel la tâche simulée se déroule. L'originalité de l'ontologie proposée réside dans le fait qu'elle conceptualise des connaissances hétérogènes (données sémantiques, topologiques et géométriques) tant sur les obstacles que sur les modèles d'espace libre. Deuxièmement, nous exploitons cette ontologie pour générer automatiquement une requête de planification de trajectoire associée à chaque action primitive donnée d'un plan de tâches. Grâce à un processus de raisonnement impliquant les actions primitives instanciées dans l'ontologie, nous sommes capables de déduire les configurations de départ et d'objectif, ainsi que les contraintes géométriques liées aux tâches. Enfin, un planificateur de trajet multi-niveaux est appelé pour générer la trajectoire. Les contributions de ce travail ont été validées par la simulation de plusieurs tâches de manipulation sous de fortes contraintes géométriques. Les résultats obtenus démontrent que l'utilisation de l'information liée aux tâches permet un meilleur contrôle sur l'algorithme de planification de trajectoire RRT pour vérifier la faisabilité du mouvement des actions primitives d'un plan de tâches, ce qui entraîne une réduction du temps de calcul et des trajectoires plus pertinentes pour les actions primitives<br>This work deals with the simulation and the validation of complex manipulation tasks under strong geometric constraints in virtual environments. The targeted applications relate to the industry 4.0 framework; as up-to-date products are more and more integrated and the economic competition increases, industrial companies express the need to validate, from design stage on, not only the static CAD models of their products but also the tasks (e.g., assembly or maintenance) related to their Product Lifecycle Management (PLM). The scientific community looked at this issue from two points of view: - Task planning decomposes a manipulation task to be realized into a sequence of primitive actions (i.e., a task plan) - Path planning computes collision-free trajectories, notably for the manipulated objects. It traditionally uses purely geometric data, which leads to classical limitations (possible high computational processing times, low relevance of the proposed trajectory concerning the task to be performed, or failure); recent works have shown the interest of using higher abstraction level data. Joint task and path planning approaches found in the literature usually perform a classical task planning step, and then check out the feasibility of path planning requests associated with the primitive actions of this task plan. The link between task and path planning has to be improved, notably because of the lack of loopback between the path planning level and the task planning level: - The path planning information used to question the task plan is usually limited to the motion feasibility where richer information such as the relevance or the complexity of the proposed path would be needed; - path planning queries traditionally use purely geometric data and/or “blind” path planning methods (e.g., RRT), and no task-related information is used at the path planning level Our work focuses on using task level information at the path planning level. The path planning algorithm considered is RRT; we chose such a probabilistic algorithm because we consider path planning for the simulation and the validation of complex tasks under strong geometric constraints. We propose an ontology-based approach to use task level information to specify path planning queries for the primitive actions of a task plan. First, we propose an ontology to conceptualize the knowledge about the 3D environment in which the simulated task takes place. The environment where the simulated task takes place is considered as a closed part of 3D Cartesian space cluttered with mobile/fixed obstacles (considered as rigid bodies). It is represented by a digital model relying on a multilayer architecture involving semantic, topologic and geometric data. The originality of the proposed ontology lies in the fact that it conceptualizes heterogeneous knowledge about both the obstacles and the free space models. Second, we exploit this ontology to automatically generate a path planning query associated to each given primitive action of a task plan. Through a reasoning process involving the primitive actions instantiated in the ontology, we are able to infer the start and the goal configurations, as well as task-related geometric constraints. Finally, a multi-level path planner is called to generate the corresponding trajectory. The contributions of this work have been validated by full simulation of several manipulation tasks under strong geometric constraints. The results obtained demonstrate that using task-related information allows better control on the RRT path planning algorithm involved to check the motion feasibility for the primitive actions of a task plan, leading to lower computational time and more relevant trajectories for primitive actions
2
Kobiela, Marta Anna. "An eighth grade curriculum incorporating logical thinking and active learning." Texas A&M University, 2006. http://hdl.handle.net/1969.1/4234.
Full textAbstract:
With the increasing stress on teachers and students to meet and raise mathematics
standards in schools, especially in the secondary level, the need for strong curricula and
supporting materials for teachers has grown. A good curriculum, however, must do
more than align with state standards and teach to the state exams; it must encourage
students to enjoy mathematics. In an effort to help ease the plague of math anxiety, this
thesis presents an eighth grade curriculum, called MathTAKStic, not only directly
aligning with the Texas state standards, the Texas Essential Knowledge Skills (TEKS),
but also encouraging students to pursue higher level thinking through active learning and
logical thinking. To test the curriculum and find out its usefulness, several lessons were
taught at a middle school. Although the scores of those learning with the curriculum
were not always better than others, MathTAKStic led to a greater increase in studentsâÂÂ
performance compared to those who were not exposed to the lessons, an increased
interest in math and a plethora of ideas for the future. These results were concluded
based on a comparison of studentsâ scores from the previous year to the current year on
the Texas standardized test. Overall, the increase in passing scores of MathTAKStic
students preceded other classes in the same school.
3
Perundurai, Rajasekaran Siddharthan. "Nonparametric Inverse Reinforcement Learning and Approximate Optimal Control with Temporal Logic Tasks." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-theses/1205.
Full textAbstract:
"This thesis focuses on two key problems in reinforcement learning: How to design reward functions to obtain intended behaviors in autonomous systems using the learning-based control? Given complex mission specification, how to shape the reward function to achieve fast convergence and reduce sample complexity while learning the optimal policy? To answer these questions, the first part of this thesis investigates inverse reinforcement learning (IRL) method with a purpose of learning a reward function from expert demonstrations. However, existing algorithms often assume that the expert demonstrations are generated by the same reward function. Such an assumption may be invalid as one may need to aggregate data from multiple experts to obtain a sufficient set of demonstrations. In the first and the major part of the thesis, we develop a novel method, called Non-parametric Behavior Clustering IRL. This algorithm allows one to simultaneously cluster behaviors while learning their reward functions from demonstrations that are generated from more than one expert/behavior. Our approach is built upon the expectation-maximization formulation and non-parametric clustering in the IRL setting. We apply the algorithm to learn, from driving demonstrations, multiple driver behaviors (e.g., aggressive vs. evasive driving behaviors). In the second task, we study whether reinforcement learning can be used to generate complex behaviors specified in formal logic — Linear Temporal Logic (LTL). Such LTL tasks may specify temporally extended goals, safety, surveillance, and reactive behaviors in a dynamic environment. We introduce reward shaping under LTL constraints to improve the rate of convergence in learning the optimal and probably correct policies. Our approach exploits the relation between reward shaping and actor-critic methods for speeding up the convergence and, as a consequence, reducing training samples. We integrate compositional reasoning in formal methods with actor-critic reinforcement learning algorithms to initialize a heuristic value function for reward shaping. This initialization can direct the agent towards efficient planning subject to more complex behavior specifications in LTL. The investigation takes the initial step to integrate machine learning with formal methods and contributes to building highly autonomous and self-adaptive robots under complex missions."
4
Morris, M. Frances G. "The psychology of information selection and reasoning." Thesis, Bangor University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361192.
Full text
5
Grossman, Mark. "Task Interaction and Control System (TICS) /." Full text open access at:, 1987. http://content.ohsu.edu/u?/etd,140.
Full text
6
Guo, Meng. "Hybrid Control of Multi-robot Systems under Complex Temporal Tasks." Doctoral thesis, KTH, Reglerteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177639.
Full textAbstract:
Autonomous robots like household service robots, self-driving cars and dronesare emerging as important parts of our daily lives in the near future. They need tocomprehend and fulfill complex tasks specified by the users with minimal humanintervention. Also they should be able to handle un-modeled changes and contingentevents in the workspace. More importantly, they shall communicate and collaboratewith each other in an efficient and correct manner. In this thesis, we address theseissues by focusing on the distributed and hybrid control of multi-robot systemsunder complex individual tasks. We start from the nominal case where a single dynamical robot is deployed in astatic and fully-known workspace. Its local tasks are specified as Linear TemporalLogic (LTL) formulas containing the desired motion. We provide an automatedframework as the nominal solution to construct the hybrid controller that drives therobot such that its resulting trajectory satisfies the given task. Then we expand theproblem by considering a team of networked dynamical robots, where each robot hasa locally-specified individual task also as LTL formulas. In particular, we analyzefour different aspects as described below. When the workspace is only partially known to each robot, the nominal solutionmight be inadequate. Thus we first propose an algorithm for initial plan synthesis tohandle partially infeasible tasks that contain hard and soft constraints. We designan on-line scheme for each robot to verify and improve its local plan during runtime, utilizing its sensory measurements and communications with other robots. Itis ensured that the hard constraints for safety are always fulfilled while the softconstraints for performance are improved gradually. Secondly, we introduce a new approach to construct a full model of both robotmotion and actions. Based on this model, we can specify much broader robotic tasksand it is used to model inter-robot collaborative actions, which are essential for manymulti-robot applications to improve system capability, efficiency and robustness.Accordingly, we devise a distributed strategy where the robots coordinate theirmotion and action plans to fulfill the desired collaboration by their local tasks. Thirdly, continuous relative-motion constraints among the robots, such as collision avoidance and connectivity maintenance, are closely related to the stability,safety and integrity of multi-robot systems. We propose two different hybrid controlapproaches to guarantee the satisfaction of all local tasks and the relative-motionconstraints at all time: the first one is based on potential fields and nonlinear controltechnique; the second uses Embedded Graph Grammars (EGGs) as the main tool. At last, we take into account two common cooperative robotic tasks, namelyservice and formation tasks. These tasks are requested and exchanged among therobots during run time. The proposed hybrid control scheme ensures that the real-time plan execution incorporates not only local tasks of each robot but also thecontingent service and formation tasks it receives. Some of the theoretical results of the thesis have been implemented and demonstrated on various robotic platforms.<br>Denna avhandling fokuserar på distribuerad och hybridstyrning av multi-robot-system för komplexa, lokala och tidsberoende uppgifter. Dessa uppgifter specificerasav logiska formler rörande robotens rörelser och andra ageranden. Avhandlingenbehandlar ett tvärvetenskapligt område som integrerar reglering av nätverkaderobotsystem och planering baserad på formella metoder. Ett ramverk för hybridstyrning av flera dynamiska robotar med lokalt specificerade uppgifter presenteras.Fyra huvudscenarier betraktas: (1) robot-planering med motstridiga arbetsuppgifterinom ett delvis okänt arbetsområde; (2) beroende uppgifter för en grupp heterogenaoch samverkande robotar; (3) relativa rörelsebegränsningar hos varje robot; samt(4) robotar med uppgifter som begärs och bekräftas under körning. Numeriskasimuleringar och experiment visas för att validera de teoretiska resultaten.<br><p>QC 20151204</p><br>EU STREP RECONFIG: FP7-ICT-2011-9-600825<br>Swedish Research Council (VR)
7
Lindemann, Lars. "Robust and Abstraction-free Control of Dynamical Systems under Signal Temporal Logic Tasks." Licentiate thesis, KTH, Reglerteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-227030.
Full textAbstract:
Dynamical systems that provably satisfy given specifications have become increasingly important in many engineering areas. For instance, safety-critical systems such as human-robot networks or autonomous driving systems are required to be safe and to also satisfy some complex specifications that may include timing constraints, i.e., when or in which order some tasks should be accomplished. Temporal logics have recently proven to be a valuable tool for these control systems by providing a rich specification language. Existing temporal logic-based control approaches discretize the underlying dynamical system in space and/or time, which is commonly referred to as the abstraction process. In other words, the continuous dynamical system is abstracted into a finite system representation, e.g., into a finite state automaton. Such approaches may lead to high computational burdens due to the curse of dimensionality, which makes it hard to use them in practice. Especially with respect to multi-agent systems, these methods do not scale computationally when the number of agents increases. We will address this open research question by deriving abstraction-free control methods for single- and multi-agent systems under signal temporal logic tasks. Another aim of this research is to consider robustness, which is partly taken care of by the robust semantics admitted by signal temporal logic as well as by the robustness properties of the derived control methods. In this work, we propose computationally-efficient frameworks that deal with the aforementioned problems for single- and multi-agent systems by using feedback control strategies such as optimization-based techniques, prescribed performance control, and control barrier functions in combination with hybrid systems theory that allows us to model some higher level decision-making. In each of these approaches, the temporal properties of the employed control methods are used to impose a temporal behavior on the closed-loop system dynamics, which eventually results in the satisfaction of the signal temporal logic task. With respect to the multi-agent case, we consider a bottom-up approach where each agent is subject to a local (individual) task. These tasks may depend on the behavior of other agents. Hence, the multi-agent system is subject to couplings induced on the task level as well as on the dynamical level. The main challenge then is to deal with these couplings and derive control methods that can still satisfy the given tasks or alternatively result in least violating solutions. The efficacy of the theoretical findings is demonstrated in simulations of single- and multi-agent systems under complex specifications.<br><p>QC 20180502</p>
8
Curiel, Diaz Arturo Tlacaélel. "Using formal logic to represent sign language phonetics in semi-automatic annotation tasks." Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30308/document.
Full textAbstract:
Cette thèse présente le développement d'un framework formel pour la représentation des Langues de Signes (LS), les langages des communautés Sourdes, dans le cadre de la construction d'un système de reconnaissance automatique. Les LS sont de langues naturelles, qui utilisent des gestes et l'espace autour du signeur pour transmettre de l'information. Cela veut dire que, à différence des langues vocales, les morphèmes en LS ne correspondent pas aux séquences de sons; ils correspondent aux séquences de postures corporelles très spécifiques, séparés par des changements tels que de mouvements. De plus, lors du discours les signeurs utilisent plusieurs parties de leurs corps (articulateurs) simultanément, ce qui est difficile à capturer avec un système de notation écrite. Cette situation difficulté leur représentation dans de taches de Traitement Automatique du Langage Naturel (TALN). Pour ces raisons, le travail présenté dans ce document a comme objectif la construction d'une représentation abstraite de la LS; plus précisément, le but est de pouvoir représenter des collections de vidéo LS (corpus) de manière formelle. En générale, il s'agit de construire une couche de représentation intermédiaire, permettant de faire de la reconnaissance automatique indépendamment des technologies de suivi et des corpus utilisés pour la recherche. Cette couche corresponde à un système de transition d'états (STE), spécialement crée pour représenter la nature parallèle des LS. En plus, elle peut-être annoté avec de formules logiques pour son analyse, à travers de la vérification de modèles. Pour représenter les propriétés à vérifier, une logique multi-modale a été choisi : la Logique Propositionnelle Dynamique (PDL). Cette logique a été originalement crée pour la spécification de programmes. De manière plus précise, PDL permit d'utilise des opérateurs modales comme [a] et , représentant <> et <>, respectivement. Une variante particulaire a été développée pour les LS : la PDL pour Langue de Signes (PDLSL), qui est interprété sur des STE représentant des corpus. Avec PDLSL, chaque articulateur du corps (comme les mains et la tête) est vu comme un agent indépendant; cela veut dire que chacun a ses propres actions et propositions possibles, et qu'il peux les exécuter pour influencer une posture gestuelle. L'utilisation du framework proposé peut aider à diminuer deux problèmes importantes qui existent dans l'étude linguistique des LS : hétérogénéité des corpus et la manque des systèmes automatiques d'aide à l'annotation. De ce fait, un chercheur peut rendre exploitables des corpus existants en les transformant vers des STE. Finalement, la création de cet outil à permit l'implémentation d'un système d'annotation semi-automatique, basé sur les principes théoriques du formalisme. Globalement, le système reçoit des vidéos LS et les transforme dans un STE valide. Ensuite, un module fait de la vérification formelle sur le STE, en utilisant une base de données de formules crée par un expert en LS. Les formules représentent des propriétés lexicales à chercher dans le STE. Le produit de ce processus, est une annotation qui peut être corrigé par des utilisateurs humains, et qui est utilisable dans des domaines d'études tels que la linguistique<br>This thesis presents a formal framework for the representation of Signed Languages (SLs), the languages of Deaf communities, in semi-automatic recognition tasks. SLs are complex visio-gestural communication systems; by using corporal gestures, signers achieve the same level of expressivity held by sound-based languages like English or French. However, unlike these, SL morphemes correspond to complex sequences of highly specific body postures, interleaved with postural changes: during signing, signers use several parts of their body simultaneously in order to combinatorially build phonemes. This situation, paired with an extensive use of the three-dimensional space, make them difficult to represent with tools already existent in Natural Language Processing (NLP) of vocal languages. For this reason, the current work presents the development of a formal representation framework, intended to transform SL video repositories (corpus) into an intermediate representation layer, where automatic recognition algorithms can work under better conditions. The main idea is that corpora can be described with a specialized Labeled Transition System (LTS), which can then be annotated with logic formulae for its study. A multi-modal logic was chosen as the basis of the formal language: the Propositional Dynamic Logic (PDL). This logic was originally created to specify and prove properties on computer programs. In particular, PDL uses the modal operators [a] and to denote necessity and possibility, respectively. For SLs, a particular variant based on the original formalism was developed: the PDL for Sign Language (PDLSL). With the PDLSL, body articulators (like the hands or head) are interpreted as independent agents; each articulator has its own set of valid actions and propositions, and executes them without influence from the others. The simultaneous execution of different actions by several articulators yield distinct situations, which can be searched over an LTS with formulae, by using the semantic rules of the logic. Together, the use of PDLSL and the proposed specialized data structures could help curb some of the current problems in SL study; notably the heterogeneity of corpora and the lack of automatic annotation aids. On the same vein, this may not only increase the size of the available datasets, but even extend previous results to new corpora; the framework inserts an intermediate representation layer which can serve to model any corpus, regardless of its technical limitations. With this, annotations is possible by defining with formulae the characteristics to annotate. Afterwards, a formal verification algorithm may be able to find those features in corpora, as long as they are represented as consistent LTSs. Finally, the development of the formal framework led to the creation of a semi-automatic annotator based on the presented theoretical principles. Broadly, the system receives an untreated corpus video, converts it automatically into a valid LTS (by way of some predefined rules), and then verifies human-created PDLSL formulae over the LTS. The final product, is an automatically generated sub-lexical annotation, which can be later corrected by human annotators for their use in other areas such as linguistics
9
Vander, Wood Melissa Ann. "Actual and self-assessed performance on a logical reasoning task after a night of total or partial sleep deprivation." Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1211388594/.
Full text
10
Vargas, Patricia Kayser. "Exploração de paralelismo ou em uma linguagem em lógica com restrições." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1998. http://hdl.handle.net/10183/26307.
Full textAbstract:
Este trabalho a dedicado ao estudo da exploração de paralelismo OU na programação em lógica com restrições em ambientes distribuídos. A programação em lógica, cuja linguagem mais significativa 6 Prolog, tem como premissa a utilização da lógica de predicados como linguagem computacional. A programação em lógica com restrições (CLP) é uma extensão da programação em lógica, onde busca-se a eficiência e a possibilidade de executar novas classes de problemas. Variáveis em CLP podem pertencer a domínios específicos como, por exemplo, reais ou booleanos. O principal conceito introduzido é a restrição. Restrição a uma equação que representa uma certa informação sobre uma variável e a sua relação com outras variáveis. o uso de restrições foi proposto para diminuir o espaço de busca na execução dos programas. Apesar de mais eficientes que a programação em lógica clássica, para algumas aplicações reais o desempenho das linguagens CLP ainda é insatisfatório. Por isso, é necessário buscar alternativas novas como a execução em paralelo. A exploração de paralelismo implícito em programas em 1ógica já demonstrou resultados promissores. Vários modelos foram propostos e implementados utilizando as duas principais fontes de paralelismo — E e OU — de forma isolada ou combinada. O objetivo principal desse trabalho é apresentar o modelo pclp(FD) de exploração de paralelismo OU multi-sequêncial para um ambiente com memória distribuída. O modelo pclp(FD) caracteriza-se pela existência de vários trabalhadores, cada um deles possuindo uma maquina abstrata completa. O escalonamento de tarefas a realizado por uma política dinâmica e distribuída. Uma tarefa em pclp(FD) equivale a um ponto de escolha e a um contexto de execução. O contexto de execução a formado por porções da pilha do exportador. Para que o importador tenha acesso ao contexto de execução utiliza-se a cópia incremental, que a uma das varias técnicas possíveis. Cada trabalhador possui a sua própria copia privada das pilhas de execução. A cópia caracteriza-se pelo envio das pilhas de execução do exportador para uma área privada do importador. A cópia incremental é uma técnica mais otimizada que verifica a existência de partes comuns entre os trabalhadores, copiando apenas as panes novas. O algoritmo de cópia incremental proposto no modelo a feito sem nenhuma centralização de informação do estado das pilhas. O projeto e implementação de um prot6tipo para esse modelo, utilizando a linguagem clp(FD), que implementa CLP sobre domínios finitos, permitirá uma analise das vantagens e desvantagens do modelo proposto. Os resultados obtidos com a análise servirão de base para trabalhos futuros, visando aprimorar a implementação e o modelo.<br>This work is dedicated to the study of the exploration of OR parallelism in Constraint Logic Programming for distributed environment. Logic Programming, which the most meaningful language is Prolog, has as premise the use of the logic of predicates as computational language. Constraint Logic Programming or CLP is an extension of the logic programming, where efficiency and the possibility to execute new kinds of problems are searched. A variable in CLP can belong to specific domains as, for example, Real or Boolean. The main concept introduced is the constraint. Constraint is an equation that represents a certain information over a variable and its relation with others variables. The use of constraints was proposed to decrease search space in the program execution. Although it is more efficient than classic logic programming, for some real applications, the performance of CLP languages still is unsatisfactory. So, it is necessary to search alternatives as parallel execution. The exploration of implicit parallelism in programs in logic has already demonstrated promising results. Several models have been proposed and implemented using the two main sources of parallelism - AND and OR — in an isolated or combined form. The main objective of this work is to present the pclp(FD) model of exploration of multi-sequential OR parallelism for a distributed memory environment. The pclp(FD) model is characterized for the existence of some workers, each one of them possessing a complete abstract machine. Task scheduling is executed by one dynamic and distributed policy. A task in pclp(FD) is equivalent to a choice point and an execution context. Execution context is formed by portions of the stack of the exporter. So that importer has access to the execution context, it uses incremental copy, which is one of the several possible techniques. The copy is characterized for sending execution stacks of the exporter to a private area of the importer, that is, each worker possesses its private copy of the execution stacks. The incremental copy is a more optimized technique that verifies the existence of common parts between workers, copying only the new ones. The incremental copy algorithm proposed in the model executes without centralized information of the state of the stacks. A prototype project and implementation for this model, using the language clp(FD), that implements CLP over finite domains, will allow an analysis of advantages and disadvantages of the considered model. The results gotten with the analysis will serve of base for future works, aiming to improve the implementation and the model.
Books on the topic "Logical tasks"
1
Dyagilev, Vasiliy, and Pavel Razov. Logic. Theory of argumentation. INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1085524.
Full textAbstract:
The textbook covers the main sections of the course of formal logic, the principles of drawing conclusions, the basics of argumentation and communication. The topics are presented taking into account the achievements of modern logical science.
 In addition to the theoretical part, practical tasks and texts for analytical analysis are included.
 Meets the requirements of the federal state educational standards of higher education of the latest generation. 
 It is intended for bachelors, undergraduates and postgraduates of humanitarian specialties. It can also be used by anyone who wants to study logic and the theory of argumentation or improve their knowledge in these disciplines.
2
Sinchenko, Georgiy. The logic of the dissertation. INFRA-M Academic Publishing LLC., 2025. https://doi.org/10.12737/2173831.
Full textAbstract:
The textbook is a set of rules, techniques and recommendations developed on the basis of formal logic. The minimum of formal and logical knowledge is presented in the form in which it can be directly used to solve a wide range of cognitive tasks of dissertation research. Tips and recommendations are given in a general context with an analysis of examples from dissertations, abstracts and publications in various fields of science. It is intended for applicants for the degree of Candidate of Sciences, and is of interest to applicants for the degree of Doctor of Sciences and anyone who wants to enhance the culture of research work.
3
Biryukov, Vladimir, and Pavel Sharonin. Theory of economic analysis. INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1851552.
Full textAbstract:
The textbook reveals the theoretical and organizational foundations, information support of economic analysis. It contains a description of the techniques, methods and methods of analytical research used both in the practical activities of economic entities and in scientific research; a description of the types of economic analysis; a methodology for determining the value of intra-production reserves. 
 It is structured in such a way that the student can understand not only the essence of economic analysis, but also develop practical skills for conducting economic analysis of organizations' activities. The material is illustrated with structural and logical schemes, generalizing analytical tables and many practical examples. To consolidate knowledge, at the end of each chapter there are questions for self-control and tasks in a test form. 
 The fifth edition of the textbook is supplemented with practical tasks on all topics of the course, which allows students to develop and consolidate analytical thinking skills.
 Meets the requirements of the federal state educational standards of higher education of the latest generation.
 For bachelors studying in the field of training 38.03.01 "Economics" of all profiles, graduate students, teachers of economic universities, specialists of economic and financial services of organizations, auditors.
4
Akat'eva, Marina. Documentation of business operations and accounting of the organization's property. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1070199.
Full textAbstract:
The textbook covers the entire range of issues of documenting business operations and accounting for the organization's property, taking into account current regulations and legislation. The textbook allows you not only to understand the essence of documenting business operations and accounting for the organization's property, but also to develop practical skills on these issues.
 The presentation of the material is illustrated by structural and logical diagrams, generalizing analytical tables, and many practical examples. In order to consolidate knowledge, self-control questions and test tasks are provided at the end of each Chapter.
 Meets the requirements of the Federal state educational standards of secondary professional education of the latest generation.
 The textbook is aimed at students in the specialty 38.02.01 "Economics and accounting (by industry)", as well as teachers of economic educational institutions of secondary vocational education, specialists of economic and financial services organizations, auditors.
5
Levchaev, Petr. Finance companies. INFRA-M Academic Publishing LLC., 2017. http://dx.doi.org/10.12737/22549.
Full textAbstract:
The textbook describes theoretical, methodological and practical bases of Finance companies. Logical structure of presentation allows you to consistently learn as the basic material of the course and the topics corresponding to the conceptual higher level of knowledge.
 For a comprehensive assimilation of the provisions of the course "Finance organizations" topics of the discipline are given control questions and tasks for self-examination of knowledge of students, thesis topics and modern research directions of Finance of organizations and themes of final qualification works, questions to prepare for the exam, and recommended reading. Set out the problematic situation of Finance companies in the innovation economy.
 Meets the requirements of Federal state educational standard of higher education of the last generation.
 For students, postgraduates and teachers of economic specialties. Be useful to a wide circle of readers interested in the problems of Finance companies.
7
Shumilina, Vera, Galina Krohicheva, Nataliya Izvarina, et al. Application of accounting, analysis and audit in enterprise management. AUS PUBLISHERS, 2021. http://dx.doi.org/10.26526/monography_618ba6f2989171.05397055.
Full textAbstract:
It is impractical to plan the further work of the company without taking into account analytical data for previous production periods. Analytical accounting data allows managers to build a company's strategy or make changes to an existing development plan. The importance of accounting for the enterprise plays a large role at the planning stage of the further business strategy. A competent manager studies accounting data before making the next decision regarding the company's finances. The easiest way to streamline accounting documents and eliminate errors in it is to conduct an internal audit. Such an audit will protect the company from possible fines and problems with tax audits. It will help optimize accounting and document flow, and simplify relations with banks and counterparties. Economic analysis aims to turn economic and non-economic information into useful information for decision making. Logical processing, study, generalization of facts, their systematization, conclusions, proposals, search for reserves - all these tasks are solved within the framework of economic analysis, which is designed to ensure the validity of management decisions and increase its effectiveness.
 This monograph is a collective work of teachers and students of the Department of Economic Security, Accounting and Law of the Don State Technical University. It is devoted to the consideration of certain issues of accounting, audit and economic analysis at the enterprise in modern conditions.
8
Sinclair-Desgagne, Bernard. The first-order approach to multi-task principal-agent problems. INSEAD, 1991.
Find full text
9
Konurbaev, Marklen. Logic, propositions, and typology of texts in English.Critical Aristotle. Politics. INFRA-M Academic Publishing LLC., 2025. https://doi.org/10.12737/2169267.
Full textAbstract:
The textbook was created within the framework of the academic discipline "Logic, proposition and typology of texts" and is focused on integrative work with the text of Aristotle's "Politics" (philosophical treatise "Politics") in English, including analytical reading based on the method of critical thinking, with its subsequent written interpretation. It contains tasks and exercises for the text of "Politics" aimed at maximizing its understanding and developing writing skills. For students of philological faculties, graduate students and teachers.
10
Logunova, Oksana, Petr Romanov, and Elena Il'ina. Processing of experimental data on a computer. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1064882.
Full textAbstract:
The textbook provides information about the main methods and tools for automating computational processes used in data processing; methods for representing and generating models of experimental data; data models and classification of processing tasks; and the organization of the user interface in automated systems for processing experimental data. Contains structured chapters on the specifics of experimental research. The features of using software for processing experimental data are clearly and logically described. Theoretical material and basic algorithms for processing experimental data used in industrial statistics are presented. Examples of processing experimental data in the field of metallurgy and management in higher education are given. Meets the requirements of the Federal state educational standards of higher education of the latest generation. For students and postgraduates of higher educational institutions.
Book chapters on the topic "Logical tasks"
1
Peterson, Donald. "Logical Space and Truth-Functionality." In The Tasks of Contemporary Philosophy / Die Aufgaben der Philosophie in der Gegenwart. J.F. Bergmann-Verlag, 1986. http://dx.doi.org/10.1007/978-3-662-30341-2_79.
Full text
2
Wahl, Russell. "The Logical form of Objects in Wittgenstein’s Tractatus." In The Tasks of Contemporary Philosophy / Die Aufgaben der Philosophie in der Gegenwart. J.F. Bergmann-Verlag, 1986. http://dx.doi.org/10.1007/978-3-662-30341-2_81.
Full text
3
Van den Heuvel-Panhuizen, Marja, Dag Oskar Madsen, Monica Alstad, Ruth-Amalie Breckan, and Anne Marthe Johansen. "Giving a Boost to Textbook Tasks." In Recent Advances in Mathematics Textbook Research and Development. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-8426-4_49.
Full textAbstract:
AbstractDespite the generally acknowledged relevance of providing students with rich, challenging tasks that require genuine problem solving, several studies have shown that these tasks are often lacking in textbooks. Bringing new textbooks to the market might feel as a logical solution for this, but maybe there is also another way of resolving this problem in which teachers can also play a pivotal role: Enriching textbook tasks. In this paper we report about a case study carried out in a Norwegian fifth-grade classroom in which we explored Denisse Thompson’s suggestion (2012) to make textbooks richer by modifying existing textbook exercises. The focus in our study is on multi-digit algorithmic subtraction. The analysis of the students’ worksheets shows some interesting differences between the original and the enriched tasks.
4
Bedny, Gregory Z., and Inna S. Bedny. "Design of Computerized Tasks with Complex Logical and Probabilistic Structure." In Work Activity Studies Within the Framework of Ergonomics, Psychology, and Economics. CRC Press, 2018. http://dx.doi.org/10.1201/9781351125000-7.
Full text
5
Mitas, Andrzej W., Anna M. Lipowicz, Agata M. Wijata, and Maria J. Bieńkowska. "Impact of Music on the Effectiveness of Performing Mathematical-Logical Tasks." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39796-2_34.
Full text
6
Lu, Jeffrey, and Ivan Rodriguez. "Deep Manifold Learning for Reading Comprehension and Logical Reasoning Tasks with Polytuplet Loss." In Lecture Notes in Networks and Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-53963-3_23.
Full text
7
Solaki, Anthia, and Fernando R. Velázquez-Quesada. "Towards a Logical Formalisation of Theory of Mind: A Study on False Belief Tasks." In Logic, Rationality, and Interaction. Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-60292-8_22.
Full text
8
Ba, Mouhamadou. "Guided Composition of Tasks with Logical Information Systems - Application to Data Analysis Workflows in Bioinformatics." In The Semantic Web: Semantics and Big Data. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38288-8_47.
Full text
9
Bedny, Gregory Z., and Inna S. Bedny. "Tasks with Complex Logical and Probabilistic Structure and Assessment of Probability of Decision-Making Outcomes." In Work Activity Studies Within the Framework of Ergonomics, Psychology, and Economics. CRC Press, 2018. http://dx.doi.org/10.1201/9781351125000-5.
Full text
10
Blicha, Martin, Konstantin Britikov, and Natasha Sharygina. "The Golem Horn Solver." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_10.
Full textAbstract:
AbstractThe logical framework of Constrained Horn Clauses (CHC) models verification tasks from a variety of domains, ranging from verification of safety properties in transition systems to modular verification of programs with procedures. In this work we present Golem, a flexible and efficient solver for satisfiability of CHC over linear real and integer arithmetic. Golem provides flexibility with modular architecture and multiple back-end model-checking algorithms, as well as efficiency with tight integration with the underlying SMT solver. This paper describes the architecture of Golem and its back-end engines, which include our recently introduced model-checking algorithm TPA for deep exploration. The description is complemented by extensive evaluation, demonstrating the competitive nature of the solver.
Conference papers on the topic "Logical tasks"
1
Cheberiachko, Serhii, Dmytro Radchuk, Yuriy Cheberiachko, Oleg Deryugin, and Mykola Naumov. "Evaluation of the Impact of Wearing a Filtering Half Mask on the Cognitive Indicators of Users." In 8th International Congress "Environment Protection. Energy Saving. Sustainable Environmental Management". Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-1jvlxw.
Full textAbstract:
Purpose. Study of the influence of users' cognitive indicators on decision-making time when using filtering half masks. Method. 10 men and 5 women who used RPA-DE filtering half masks manufactured by Research and Production Enterprise STANDART took part in the study. During the study, the time and speed of the reaction of half masks users to a stimulus were determined, which allows us to assess the speed of decision-making when performing professional activities in a polluted working environment. The tasks were performed in the absence of physical exertion: once in a half mask, another time without a half mask (control value). The tasks measured the ability to suppress obstacles (Stroop Color Word test), visual search speed, processing speed and mental flexibility, reaction speed (Trailmaking Halstead–Reitan test), level of attention and logical thinking (Raven's Test), anxiety level (IDRlabs resource .com). Three main tasks were performed by the research participant for 40 minutes, after which a test was performed to determine the level of anxiety. Results. The ability to suppress obstacles, reaction speed, and level of logical thinking did not differ significantly between the control value and when wearing a half mask. As for women, the speed of reaction was higher than for men, but in groups of both sexes (in each of the groups) there were no significant differences between tests with and without a half mask. When performing any task to determine the speed of reaction and logic of thinking while wearing a half mask, the results of men and women and when comparing them with each other did not have significant differences. At the same time, the level of anxiety during tasks was 8% higher with the use of half mask s than without it. Scientific novelty. It has been established that wearing a filtering half mask increases the level of stress and anxiety of users when performing mental tasks due to an increase in the load on the cardiovascular system. Practical value. The results show that short-term wearing of a half mask in the lack of other influences does not impair cognitive performance, which indicates the absence of additional risks when using personal protective equipment for users when performing industrial tasks .
2
Tena Cucala, David J., and Bernardo Cuenca Grau. "Bridging Max Graph Neural Networks and Datalog with Negation." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/89.
Full textAbstract:
We consider a general class of data transformations based on Graph Neural Networks (GNNs), which can be used for a wide variety of tasks. An important question in this setting is to characterise the expressive power of these transformations in terms of a suitable logic-based language. From a practical perspective, the correspondence of a GNN with a logical theory can be exploited for explaining the model's predictions symbolically. In this paper, we introduce a broad family of GNN-based transformations which can be characterised using Datalog programs with negation-as-failure, which can be computed from the GNNs after training. This generalises existing approaches based on positive programs by enabling the learning of nonmonotonic transformations. We show empirically that these GNNs offer good performance for knowledge graph completion tasks, and that we can efficiently extract programs for explaining individual predictions.
3
Biletska, Maryna, Tatiana Pidvarko, Lina Kotova, and Karina Oleksenko. "THE CREATIVE HERITAGE OF DAVID OISTRAKH IN THE MUSICAL ART OF THE XX CENTURY." In 11th SWS International Scientific Conferences on ART and HUMANITIES - ISCAH 2024. SGEM WORLD SCIENCE, 2024. https://doi.org/10.35603/sws.iscah.2024/s08.21.
Full textAbstract:
The creation of D. Oistrakh is one of the highest achievements in the native musical art of the 20th century. D. Oistrakh�s impressive performing skills, the philosophical depth and the scale of his interpretations, the sensitivity to everything new were combined with the inspiration of the pedagogical work, the special care about the transformation of his great creative experience to the new generation of the violinists. Studying the creative heritage of D. Oistrakh, we can confirm that he has created the original pedagogical system that synthesized the most progressive methods of the native and the world violin pedagogy and combined organically them with the tasks of instrumentalperforming practice. The purpose of the research is to reveal the essence of performing aesthetics and the content of D. Oistrakh�s pedagogical principles and to trace their influence on the modern practice of violin art. The scientific basis of the article is the interdisciplinary approach, which led to the complex use of the general scientific and the special methods. They are, in particular, the methods of analysis and synthesis, induction and deduction, comparative-historical and logical analysis, and also the principles of historicism, the scientific objectivity, systematicity during the research of the creative heritage of the outstanding personality. The tasks of the research included revealing the main features of D. Oistrakh�s musical-performing and the pedagogical activity and investigating the meaning of his creative heritage for the modern art. Conclusions. The main features of performing aesthetics and the technological regulations of D. Oistrakh�s music-performing system have been determined in the research, especially from the point of view of musical-interpretative approaches, which significantly affect the development of the modern violin art, and also the prospects of the development of the modern violin schools in the synthesis of the different directions of violin art.
4
Biletska, Maryna, Tatiana Pidvarko, Lina Kotova, and Tetyana Stratan-Artyshkova. "METHODICAL APPROACHES TO THE STUDY OF STUDENTS` MUSICAL ABILITIES IN THE PROCESS OF PEDAGOGICAL COMMUNICATION." In 11th SWS International Scientific Conferences on SOCIAL SCIENCES - ISCSS 2024. SGEM WORLD SCIENCE, 2024. https://doi.org/10.35603/sws.iscss.2024/s08/59.
Full textAbstract:
The purpose of the research is the improvement of the socio-perceptive skills of the teachers for the correlation of the study and understanding of students� musical abilities. For the achievement of the set of goal, the general scientific methodological approaches (systemic, competent) and the research methods as abstract-logical, analysis and synthesis have been used to study, to generalize and to systematize the obtained information with the purpose of the comparison of the different views of the scientists on the problems of the pedagogical communication and the teaching of students� musical abilities. The detection of the peculiarities of the study and the levels of understanding by the teachers of the uniqueness of the students� musical abilities has been included to the tasks of the research. On the basis of the conducted research, we have found out that the increase of the level of the pedagogical communication (socialperceptive skills) of the teachers can be successfully implemented in musicalpedagogical activity. The program of the observation of the pedagogical influences and the teaching methodology of the evaluation of the effectiveness of the activity of teacher during the individual classes have been developed, and also the ways of the improvement of the socio-perceptive skills of the teachers for the correlation of the study and understanding of students� musical abilities have been outlined.
5
Xu, Zhe, and Ufuk Topcu. "Transfer of Temporal Logic Formulas in Reinforcement Learning." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/557.
Full textAbstract:
Transferring high-level knowledge from a source task to a target task is an effective way to expedite reinforcement learning (RL). For example, propositional logic and first-order logic have been used as representations of such knowledge. We study the transfer of knowledge between tasks in which the timing of the events matters. We call such tasks temporal tasks. We concretize similarity between temporal tasks through a notion of logical transferability, and develop a transfer learning approach between different yet similar temporal tasks. We first propose an inference technique to extract metric interval temporal logic (MITL) formulas in sequential disjunctive normal form from labeled trajectories collected in RL of the two tasks. If logical transferability is identified through this inference, we construct a timed automaton for each sequential conjunctive subformula of the inferred MITL formulas from both tasks. We perform RL on the extended state which includes the locations and clock valuations of the timed automata for the source task. We then establish mappings between the corresponding components (clocks, locations, etc.) of the timed automata from the two tasks, and transfer the extended Q-functions based on the established mappings. Finally, we perform RL on the extended state for the target task, starting with the transferred extended Q-functions. Our implementation results show, depending on how similar the source task and the target task are, that the sampling efficiency for the target task can be improved by up to one order of magnitude by performing RL in the extended state space, and further improved by up to another order of magnitude using the transferred extended Q-functions.
6
Chatterjee, Krishnendu, Arkadeb Ghosal, Thomas A. Henzinger, et al. "Logical Reliability of Interacting Real-Time Tasks." In 2008 Design, Automation and Test in Europe. IEEE, 2008. http://dx.doi.org/10.1109/date.2008.4484790.
Full text
7
Chatterjee, Krishnendu, Arkadeb Ghosal, Thomas A. Henzinger, et al. "Logical reliability of interacting real-time tasks." In the conference. ACM Press, 2008. http://dx.doi.org/10.1145/1403375.1403595.
Full text
8
Donadello, Ivan, Luciano Serafini, and Artur d'Avila Garcez. "Logic Tensor Networks for Semantic Image Interpretation." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/221.
Full textAbstract:
Semantic Image Interpretation (SII) is the task of extracting structured semantic descriptions from images. It is widely agreed that the combined use of visual data and background knowledge is of great importance for SII. Recently, Statistical Relational Learning (SRL) approaches have been developed for reasoning under uncertainty and learning in the presence of data and rich knowledge. Logic Tensor Networks (LTNs) are a SRL framework which integrates neural networks with first-order fuzzy logic to allow (i) efficient learning from noisy data in the presence of logical constraints, and (ii) reasoning with logical formulas describing general properties of the data. In this paper, we develop and apply LTNs to two of the main tasks of SII, namely, the classification of an image's bounding boxes and the detection of the relevant part-of relations between objects. To the best of our knowledge, this is the first successful application of SRL to such SII tasks. The proposed approach is evaluated on a standard image processing benchmark. Experiments show that background knowledge in the form of logical constraints can improve the performance of purely data-driven approaches, including the state-of-the-art Fast Region-based Convolutional Neural Networks (Fast R-CNN). Moreover, we show that the use of logical background knowledge adds robustness to the learning system when errors are present in the labels of the training data.
9
Oliveira, Augusto C. A., Francisco L. B. Martins, Davi R. Vasconcelos, and Maria V. Menezes. "Acting Humanly: Identification and Analysis of Logical Reasoning Biases Exhibited by ChatGPT versus Undergraduate Students." In Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2024. https://doi.org/10.5753/eniac.2024.245191.
Full textAbstract:
Definitions of Artificial Intelligence (AI) include characterizing algorithms as those that: thinking humanly, thinking rationally, acting humanly and acting rationally. On the one hand, Logic, as a formal framework, allows for the creation of algorithms capable of thinking rationally by expressing real world situations in a language that enables valid and rigorous reasoning. On the other hand, Large Language Models, such as ChatGPT, represent algorithms that acting humanly, especially in tasks involving understanding and generating natural language text. However, these models can exhibit logical reasoning biases, which are tendencies that impair the ability to reason logically. This article aims to identify and analyze the logical reasoning biases exhibited by ChatGPT in comparison to those exhibited by Information Technology Undergraduate Students, beginners in the Logic course.
10
ZAHARIA, Rică. "Didactic tasks of finding and description." In "Ştiință și educație: noi abordări și perspective", conferinţă ştiinţifică internaţională. Ion Creangă Pedagogical State University, 2024. https://doi.org/10.46727/c.v4.21-22-03-2024.p120-127.
Full textAbstract:
The didactic tasks that can beproposed have been selected in such a way that through themthe entire geometry known to the student, the entire mathematical book science acquired at the moment,and especially theorems, fundamental properties, logical reasoning, techniques and methods arecovered. useful to solve them in relation to the study subject being studied at the moment.
Reports on the topic "Logical tasks"
1
Tsidylo, Ivan M., Serhiy O. Semerikov, Tetiana I. Gargula, Hanna V. Solonetska, Yaroslav P. Zamora, and Andrey V. Pikilnyak. Simulation of intellectual system for evaluation of multilevel test tasks on the basis of fuzzy logic. CEUR Workshop Proceedings, 2021. http://dx.doi.org/10.31812/123456789/4370.
Full textAbstract:
The article describes the stages of modeling an intelligent system for evaluating multilevel test tasks based on fuzzy logic in the MATLAB application package, namely the Fuzzy Logic Toolbox. The analysis of existing approaches to fuzzy assessment of test methods, their advantages and disadvantages is given. The considered methods for assessing students are presented in the general case by two methods: using fuzzy sets and corresponding membership functions; fuzzy estimation method and generalized fuzzy estimation method. In the present work, the Sugeno production model is used as the closest to the natural language. This closeness allows for closer interaction with a subject area expert and build well-understood, easily interpreted inference systems. The structure of a fuzzy system, functions and mechanisms of model building are described. The system is presented in the form of a block diagram of fuzzy logical nodes and consists of four input variables, corresponding to the levels of knowledge assimilation and one initial one. The surface of the response of a fuzzy system reflects the dependence of the final grade on the level of difficulty of the task and the degree of correctness of the task. The structure and functions of the fuzzy system are indicated. The modeled in this way intelligent system for assessing multilevel test tasks based on fuzzy logic makes it possible to take into account the fuzzy characteristics of the test: the level of difficulty of the task, which can be assessed as “easy”, “average", “above average”, “difficult”; the degree of correctness of the task, which can be assessed as “correct”, “partially correct”, “rather correct”, “incorrect”; time allotted for the execution of a test task or test, which can be assessed as “short”, “medium”, “long”, “very long”; the percentage of correctly completed tasks, which can be assessed as “small”, “medium”, “large”, “very large”; the final mark for the test, which can be assessed as “poor”, “satisfactory”, “good”, “excellent”, which are included in the assessment. This approach ensures the maximum consideration of answers to questions of all levels of complexity by formulating a base of inference rules and selection of weighting coefficients when deriving the final estimate. The robustness of the system is achieved by using Gaussian membership functions. The testing of the controller on the test sample brings the functional suitability of the developed model.
2
Hristodulo, Olga Igorevna, and Miliausha Ilgamovna Akhmetzianova. Development of a geo-information system for monitoring the attractiveness of municipalities using parametric, structural approaches (case of Republic of Bashkortostan). DOI CODE, 2021. http://dx.doi.org/10.18411/doicode-2021.003.
Full textAbstract:
To date, one of the most important tasks of the State in ensuring the sustainable socio-economic and demographic development of the country is the regulation of migration processes. In the Republic of Bashkortostan in recent years there has been an increase in the number of people participating in both intraregional and extra-regional migration, which indicates the need to manage migration flows for the effective development of territories of this entity. In this connection, this article is dedicated to the development of GIS monitoring of the attractiveness of municipalities of the Republic of Bashkortostan, aimed at improving the effectiveness of decision-making in formulating migration policies in the region, based on a systematic combination of parametric and structural approaches. In the course of the study the analysis of existing approaches applied in this subject area, the methodology for determining the attractiveness coefficient of municipalities of the Republic of Bashkortostan was developed, A functional and information model for monitoring the attractiveness of municipalities has been developed, and a logical structural model of GIS monitoring the attractiveness of municipalities of the Republic of Bashkortostan has been built.
3
Ruff, Grigory, and Tatyana Sidorina. THE DEVELOPMENT MODEL OF ENGINEERING CREATIVITY IN STUDENTS OF MILITARY INSTITUTIONS. Science and Innovation Center Publishing House, 2020. http://dx.doi.org/10.12731/model_of_engineering_creativity.
Full textAbstract:
The troops of the national guard of the Russian Federation are equipped with modern models of weapons, special equipment, Informatization tools, engineering weapons that have artificial intelligence in their composition are being developed, " etc., which causes an increase in the requirements for the quality of professional training of future officers. The increasing complexity of military professional activities, the avalanche-like increase in information, the need to develop the ability to quickly and accurately make and implement well-known and own engineering solutions in an unpredictable military environment demonstrates that the most important tasks of modern higher education are not only providing graduates with a system of fundamental and special knowledge and skills, but also developing their professional independence, and this led to the concept of engineering and creative potential in the list of professionally important qualities of an officer. To expedite a special mechanism system compact intense clarity through cognitive visualization of the educational material, thickening of educational knowledge through encoding, consolidation and structuring Principle of cognitive visualization stems from the psychological laws in accordance with which the efficiency of absorption is increased if visibility in training does not only illustrative, but also cognitive function, which leads to active inclusion, along with the left and right hemispheres of the student in the process of assimilation of information, based on the use of logical and semantic modeling, which contributes to the development of engineering and creative potential.
4
Ludwig, Michel, and Rafael Peñaloza. Error-Tolerant Reasoning in the Description Logic EL. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.209.
Full textAbstract:
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detected, users may have to wait for a long time before a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic EL. While these problems are intractable, we propose methods for improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice.
5
Distel, Felix. Model-based Most Specific Concepts in Description Logics with Value Restrictions. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.167.
Full textAbstract:
Non-standard inferences are particularly useful in the bottom-up construction of ontologies in description logics. One of the more common non-standard reasoning tasks is the most specific concept (msc) for an ABox-individual. In this paper we present similar non-standard reasoning task: most specific concepts for models (model-mscs). We show that, although they look similar to ABox-mscs their computational behaviour can be different. We present constructions for model-mscs in FL₀ and FLE with cyclic TBoxes and for ALC∪∗ with acyclic TBoxes. Since subsumption in FLE with cyclic TBoxes has not been examined previously, we present a characterization of subsumption and give a construction for the least common subsumer in this setting.
6
Brandt, Sebastian, Ralf Küsters, and Anni-Yasmin Turhan. Approximation and Difference in Description Logics. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.116.
Full textAbstract:
Approximation is a new inference service in Description Logics first mentioned by Baader, Küsters, and Molitor. Approximating a concept, defined in one Description Logic, means to translate this concept to another concept, defined in a second typically less expressive Description Logic, such that both concepts are as closely related as possible with respect to subsumption. The present paper provides the first in-depth investigation of this inference task. We prove that approximations from the Description Logic ALC to ALE always exist and propose an algorithm computing them. As a measure for the accuracy of the approximation, we introduce a syntax-oriented difference operator, which yields a concept description that contains all aspects of the approximated concept that are not present in the approximation. It is also argued that a purely semantical difference operator, as introduced by Teege, is less suited for this purpose. Finally, for the logics under consideration, we propose an algorithm computing the difference.
7
Peñaloza, Rafael, and Barış Sertkaya. On the Complexity of Axiom Pinpointing in Description Logics. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.173.
Full textAbstract:
We investigate the computational complexity of axiom pinpointing in Description Logics, which is the task of finding minimal subsets of a knowledge base that have a given consequence. We consider the problems of enumerating such subsets with and without order, and show hardness results that already hold for the propositional Horn fragment, or for the Description Logic EL. We show complexity results for several other related decision and enumeration problems for these fragments that extend to more expressive logics. In particular we show that hardness of these problems depends not only on expressivity of the fragment but also on the shape of the axioms used.
8
Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.
Full textAbstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
9
Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.
Full textAbstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
10
Lutz, Carsten, Ulrike Sattler, and Lidia Tendera. The Complexity of Finite Model Reasoning in Description Logics. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.123.
Full textAbstract:
We analyze the complexity of finite model reasoning in the description logic ALCQI, i.e. ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are EXPTIME-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.