Relevant bibliographies by topics / One order logic

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'One order logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'One order logic.'

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 "One order logic"

1

Niemistö, Hannu. "Zero-one law and definability of linear order." Journal of Symbolic Logic 74, no. 1 (2009): 105–23. http://dx.doi.org/10.2178/jsl/1231082304.

Full text
Abstract:
§1. Introduction. A logic ℒ has a limit law, if the asymptotic probability of every query definable in ℒ converges. It has a 0–1-law if the probability converges to 0 or 1. The 0–1-law for first-order logic on relational vocabularies was independently found by Glebski et al. [6] and Fagin [5]. Later it has been shown for many other logics, for instance for fragments of second order logic [12], for finite variable logic [13] and for FO extended with the rigidity quantifier [3]. Lynch [14] has shown a limit law for first-order logic on vocabularies with unary functions.We say that two formulas o
APA, Harvard, Vancouver, ISO, and other styles
2

Gabbay, M. J., and A. Mathijssen. "One-and-a-halfth-order Logic." Journal of Logic and Computation 18, no. 4 (2007): 521–62. http://dx.doi.org/10.1093/logcom/exm064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fitting, Melvin, and Felipe Salvatore. "First-order justification logic with constant domain semantics." Journal of Logic and Computation 30, no. 1 (2020): 193–216. http://dx.doi.org/10.1093/logcom/exaa008.

Full text
Abstract:
Abstract Justification logic is a term used to identify a relatively new family of modal-like logics. There is an established literature about propositional justification logic, but incursions on the first-order case are scarce. In this paper we present a constant domain semantics for the first-order logic of proofs with the Barcan Formula (FOLPb); then we prove Soundness and Completeness Theorems. A monotonic semantics for a version of this logic without the Barcan Formula is already in the literature, but constant domains require substantial new machinery, which may prove useful in other con
APA, Harvard, Vancouver, ISO, and other styles
4

HARRISON-TRAINOR, MATTHEW. "FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS." Review of Symbolic Logic 12, no. 4 (2019): 637–62. http://dx.doi.org/10.1017/s1755020319000418.

Full text
Abstract:
AbstractThis article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, we show that this is impossible to do in
APA, Harvard, Vancouver, ISO, and other styles
5

Zarycki, Tomasz. "Class Analysis in Conditions of a Dual-Stratification Order." East European Politics and Societies: and Cultures 29, no. 3 (2015): 711–18. http://dx.doi.org/10.1177/0888325415599199.

Full text
Abstract:
This article presents a critique of classic applications of class analysis to Polish society. It argues from a Bourdieusian standpoint that class is subordinate to culture in shaping social relations in Poland. More specifically, Poland can be seen as a dual-stratification order, with the economic logic of class clashing continually with the logic of rank, which is defined in terms of cultural capital. These two models of logics appear to be in constant competition, which may also be related to the tension between economic and cultural elites. The latter is most clearly represented by the old
APA, Harvard, Vancouver, ISO, and other styles
6

JACINTO, BRUNO. "STRONGLY MILLIAN SECOND-ORDER MODAL LOGICS." Review of Symbolic Logic 10, no. 3 (2017): 397–454. http://dx.doi.org/10.1017/s1755020317000119.

Full text
Abstract:
AbstractThe most common first- and second-order modal logics either have as theorems every instance of the Barcan and Converse Barcan formulae and of their second-order analogues, or else fail to capture the actual truth of every theorem of classical first- and second-order logic. In this paper we characterise and motivate sound and complete first- and second-order modal logics that successfully capture the actual truth of every theorem of classical first- and second-order logic and yet do not possess controversial instances of the Barcan and Converse Barcan formulae as theorems, nor of their
APA, Harvard, Vancouver, ISO, and other styles
7

Kufleitner, Manfred, and Tobias Walter. "One quantifier alternation in first-order logic with modular predicates." RAIRO - Theoretical Informatics and Applications 49, no. 1 (2015): 1–22. http://dx.doi.org/10.1051/ita/2014024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Towsner, Henry. "Constructing sequences one step at a time." Journal of Mathematical Logic 20, no. 03 (2020): 2050017. http://dx.doi.org/10.1142/s0219061320500178.

Full text
Abstract:
We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain–Antichain ([Formula: see text]) Principle. Using this method, we are able to prove several new separations in the presence of Weak König’s Lemma ([Formula: see text]), including showing that [Formula: see text] does not imply the thin set theorem for pairs, and that the principle “the product of well-quasi-orders is a well-quasi-order” is strictly between [Formula: see text] and the Ascending/Descending Sequences principle, even in the presence of [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
9

Bruynooghe, Maurice, Marc Denecker, and Miroslaw Truszczynski. "First Order Logic with Inductive Definitions for Model-Based Problem Solving." AI Magazine 37, no. 3 (2016): 69–80. http://dx.doi.org/10.1609/aimag.v37i3.2679.

Full text
Abstract:
In answer-set programming (ASP), programs can be viewed as specifications of finite Herbrand structures. Other logics can be (and, in fact, were) used towards the same end and can be taken as the basis of declarative programming systems of similar functionality as ASP. We discuss here one such logic, the logic FO(ID), and its implementation IDP3. The choice is motivated by notable similarities between ASP and FO(ID), even if both approaches trace back to different origins
APA, Harvard, Vancouver, ISO, and other styles
10

DYCKHOFF, ROY, and SARA NEGRI. "GEOMETRISATION OF FIRST-ORDER LOGIC." Bulletin of Symbolic Logic 21, no. 2 (2015): 123–63. http://dx.doi.org/10.1017/bsl.2015.7.

Full text
Abstract:
AbstractThat every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor easily found in the literature. Various approaches to the result are presented and discussed in detail, including one inspired by a problem in the proof theory of intermediate logics that led us to the proof of the present paper. It can be seen as a modification of Skolem’s argument from 1920 for his “Normal Form” theorem. “Geometric” being
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "One order logic"

1

Grzesiak, Frédéric. "Représentation des connaissances et techniques d'inférence pour le maniement d'objets graphiques : application au Système-Expert SYNOP." Valenciennes, 1987. https://ged.uphf.fr/nuxeo/site/esupversions/fd5e5639-ec92-4d3d-96e8-98f6c14c5743.

Full text
Abstract:
Réalisation d'un outil système expert capable d'appliquer sur une image de surveillance donnée l'ensemble des spécifications graphiques contenues dans ses bases de connaissances. Après la validation du moteur d'inférence, divers travaux ont été réalisés pour préparer l'utilisation effective du système
APA, Harvard, Vancouver, ISO, and other styles
2

Schamm, Rainer Franz. "Zero-one laws and almost sure validities on finite structures." Thesis, 2012. http://hdl.handle.net/10210/7511.

Full text
Abstract:
M.Sc.<br>This short dissertation is intended to give a brief account of the history and current state of affairs in the field of study called 'Zero-one Laws'. The probability of a property P on a class of finite relational structures is defined to be the limit of the sequence of fractions, of the n element structures that satisfy the property P, as n tends to infinity. A class of properties is said to have a Zero-One law if the above limit, which is usually called the asymptotic probability of the property with respect to the given class of finite structures, is either 0 or 1 for each property
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "One order logic"

1

Bratko, Aleksandr. Artificial intelligence, legal system and state functions. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1064996.

Full text
Abstract:
The monograph deals with methodological problems of embedding artificial intelligence in the legal system taking into account the laws of society. Describes the properties of the rule of law as a Microsystem in subsystems of law and methods of its fixation in the system of law and logic of legal norms. Is proposed and substantiated the idea of creating specifically for artificial intelligence, separate and distinct, unambiguous normative system, parallel to the principal branches of law is built on the logic of the four-membered structure of legal norms. Briefly discusses some of the theory of
APA, Harvard, Vancouver, ISO, and other styles
2

Guynes, Sean, and Dan Hassler-Forest, eds. Star Wars and the History of Transmedia Storytelling. Amsterdam University Press, 2017. http://dx.doi.org/10.5117/9789462986213.

Full text
Abstract:
Star Wars has reached more than three generations of casual and hardcore fans alike, and as a result many of the producers of franchised Star Wars texts (films, television, comics, novels, games, and more) over the past four decades have been fans-turned-creators. Yet despite its dominant cultural and industrial positions, Star Wars has rarely been the topic of sustained critical work. Star Wars and the History of Transmedia Storytelling offers a corrective to this oversight by curating essays from a wide range of interdisciplinary scholars in order to bring Star Wars and its transmedia narrat
APA, Harvard, Vancouver, ISO, and other styles
3

Fonseca, Carlos M. da. A panorama of mathematics: Pure and applied : Conference on Mathematics and Its Applications, November 14-17, 2014, Kuwait University, Safat, Kuwait. American Mathematical Society, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Florio, Salvatore, and Øystein Linnebo. The Many and the One. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198791522.001.0001.

Full text
Abstract:
Plural logic has become a well-established subject, especially in philosophical logic. This book explores its broader significance for philosophy, logic, and linguistics. What can plural logic do for us? Are the bold claims made on its behalf correct? After introducing plural logic and its main applications, the book provides a systematic analysis of the relation between this logic and other theoretical frameworks such as set theory, mereology, higher-order logic, and modal logic. The applications of plural logic rely on two assumptions, namely that this logic is ontologically innocent and has
APA, Harvard, Vancouver, ISO, and other styles
5

Tennant, Neil. Core Logic. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198777892.001.0001.

Full text
Abstract:
Core Logic has unusual philosophical, proof-theoretic, metalogical, computational, and revision-theoretic virtues. It is an elegant kernel lying deep within Classical Logic, a canon for constructive and relevant deduction furnishing faithful formalizations of informal constructive mathematical proofs. Its classicized extension provides likewise for non-constructive mathematical reasoning. Confining one’s search to core proofs affords automated reasoners great gains in efficiency. All logico-semantical paradoxes involve only core reasoning. Core proofs are in normal form, and relevant in a high
APA, Harvard, Vancouver, ISO, and other styles
6

Tollefsen, Torstein Theodor. Method and Logic in Theodore’s Treatises. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198816775.003.0002.

Full text
Abstract:
This chapter treats the structure of the three refutations Theodore wrote in order to counter the iconoclast challenges. The second refutation is written as a dialogue, and the first one should not need much editing in order to appear as a dialogue as well. The chapter also discusses our information on Theodore’s education, which is rather meagre. However, he must have had some teaching in the tradition of logic, since he shows that he knows some elements of both Aristotelian and Stoic logic. This logic is discussed in detail. Theodore applies logic as a practical tool in his defence of the ic
APA, Harvard, Vancouver, ISO, and other styles
7

Shapiro, Stewart. Higher‐order Logic. Edited by Stewart Shapiro. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780195325928.003.0025.

Full text
Abstract:
The philosophical literature contains numerous claims on behalf of and numerous claims against higher-order logic. Virtually all of the issues apply to second-order logic (vis-à-vis first-order logic), so this article focuses on that. It develops the syntax of second-order languages and present typical deductive systems and model-theoretic semantics for them. This will help to explain the role of higher-order logic in the philosophy of mathematics. It is assumed that the reader has at least a passing familiarity with the theory and metatheory of first-order logic.
APA, Harvard, Vancouver, ISO, and other styles
8

Jané, Ignacio. Higher‐order Logic Reconsidered. Edited by Stewart Shapiro. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780195325928.003.0026.

Full text
Abstract:
This article discusses canonical (i.e., full, or standard) second-order consequence and argues against it being a case of logical consequence. The discussion is divided into three parts. The first part comprises the first three sections. After stating the problem in Section 1, Sections 2 and 3 examine the role that the consequence relation is expected to play in axiomatic theories. This leads to put forward two requirements on logical consequence, which are called “formality” and “noninterference.” It is this last requirement that canonical second-order consequence violates, as the article set
APA, Harvard, Vancouver, ISO, and other styles
9

Button, Tim, and Sean Walsh. Categoricity and the natural numbers. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198790396.003.0007.

Full text
Abstract:
This chapter focuses on modelists who want to pin down the isomorphism type of the natural numbers. This aim immediately runs into two technical barriers: the Compactness Theorem and the Löwenheim-Skolem Theorem (the latter is proven in the appendix to this chapter). These results show that no first-order theory with an infinite model can be categorical; all such theories have non-standard models. Other logics, such as second-order logic with its full semantics, are not so expressively limited. Indeed, Dedekind's Categoricity Theorem tells us that all full models of the Peano axioms are isomor
APA, Harvard, Vancouver, ISO, and other styles
10

Bělohlávek, Radim, Joseph W. Dauben, and George J. Klir. Fuzzy Logic in the Narrow Sense. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190200015.003.0004.

Full text
Abstract:
The chapter examines the various propositional and predicate many-valued logics that were studied prior to the emergence of the concept of a fuzzy set in the mid-1960s, which led to the genesis of fuzzy logic in broad and narrow senses. Early ideas regarding formal systems of fuzzy logic allowed for deduction from partially true premises to partially true consequences, as suggested first by Goguen in the 1960s and further developed by Pavelka in the 1970s, and these ideas were developed from the 1990s onward. The systematic development of fuzzy logics based on t-norms and their residua, pursue
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "One order logic"

1

Grandjean, E. "First-order spectra with one variable." In Computation Theory and Logic. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18170-9_164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Durand, Arnaud, and Frédéric Olive. "First-Order Queries over One Unary Function." In Computer Science Logic. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11874683_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Durand, Arnaud, and Solomampionona Ranaivoson. "First-order spectra with one binary predicate." In Computer Science Logic. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0022255.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gabbay, Murdoch J., and Dominic P. Mulligan. "One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations." In Logic, Language, Information and Computation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-69937-8_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Coupier, David, Agnès Desolneux, and Bernard Ycart. "A Zero-One Law for First-Order Logic on Random Images." In Mathematics and Computer Science III. Birkhäuser Basel, 2004. http://dx.doi.org/10.1007/978-3-0348-7915-6_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Matz, Oliver. "One quantifier will do in existential monadic second-order logic over pictures." In Mathematical Foundations of Computer Science 1998. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055826.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chaudhuri, Kaustuv. "Subformula Linking for Intuitionistic Logic with Application to Type Theory." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_12.

Full text
Abstract:
AbstractSubformula linking is an interactive theorem proving technique that was initially proposed for (classical) linear logic. It is based on truth and context preserving rewrites of a conjecture that are triggered by a user indicating links between subformulas, which can be done by direct manipulation, without the need of tactics or proof languages. The system guarantees that a true conjecture can always be rewritten to a known, usually trivial, theorem. In this work, we extend subformula linking to intuitionistic first-order logic with simply typed lambda-terms as the term language of this logic. We then use a well known embedding of intuitionistic type theory into this logic to demonstrate one way to extend linking to type theory.
APA, Harvard, Vancouver, ISO, and other styles
8

Tammet, Tanel, Dirk Draheim, and Priit Järv. "Confidences for Commonsense Reasoning." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_29.

Full text
Abstract:
AbstractCommonsense reasoning has long been considered one of the holy grails of artificial intelligence. Our goal is to develop a logic-based component for hybrid – machine learning plus logic – commonsense question answering systems. A critical feature for the component is estimating the confidence in the statements derived from knowledge bases containing uncertain contrary and supporting evidence obtained from different sources. Instead of computing exact probabilities or designing a new calculus we focus on extending the methods and algorithms used by the existing automated reasoners for full classical first-order logic. The paper presents the CONFER framework and implementation for confidence estimation of derived answers.
APA, Harvard, Vancouver, ISO, and other styles
9

Polzer, Miriam, and Sergey Goncharov. "Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_28.

Full text
Abstract:
AbstractModelling and reasoning about dynamic memory allocation is one of the well-established strands of theoretical computer science, which is particularly well-known as a source of notorious challenges in semantics, reasoning, and proof theory. We capitalize on recent progress on categorical semantics of full ground store, in terms of a full ground store monad, to build a corresponding semantics of a higher order logic over the corresponding programs. Our main result is a construction of an (intuitionistic) BI-hyperdoctrine, which is arguably the semantic core of higher order logic over local store. Although we have made an extensive use of the existing generic tools, certain principled changes had to be made to enable the desired construction: while the original monad works over total heaps (to disable dangling pointers), our version involves partial heaps (heaplets) to enable compositional reasoning using separating conjunction. Another remarkable feature of our construction is that, in contrast to the existing generic approaches, our BI-algebra does not directly stem from an internal categorical partial commutative monoid.
APA, Harvard, Vancouver, ISO, and other styles
10

Gehrke, Mai, Tomáš Jakl, and Luca Reggio. "A Duality Theoretic View on Limits of Finite Structures." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_16.

Full text
Abstract:
AbstractA systematic theory of structural limits for finite models has been developed by Nešetřil and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a space of measures, where the desired limits can be computed. We show that a closely related but finer grained space of measures arises — via Stone-Priestley duality and the notion of types from model theory — by enriching the expressive power of first-order logic with certain “probabilistic operators”. We provide a sound and complete calculus for this extended logic and expose the functorial nature of this construction.The consequences are two-fold. On the one hand, we identify the logical gist of the theory of structural limits. On the other hand, our construction shows that the duality-theoretic variant of the Stone pairing captures the adding of a layer of quantifiers, thus making a strong link to recent work on semiring quantifiers in logic on words. In the process, we identify the model theoretic notion of types as the unifying concept behind this link. These results contribute to bridging the strands of logic in computer science which focus on semantics and on more algorithmic and complexity related areas, respectively.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "One order logic"

1

Gabbay, Murdoch J., and Aad Mathijssen. "One-and-a-halfth-order logic." In the 8th ACM SIGPLAN symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1140335.1140359.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lyaletski, Alexander, and Alexandre Lyaletsky. "On One Approach to Goal-Driven Proof Search in Classical First-Order Logic." In 2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2020. http://dx.doi.org/10.1109/synasc51798.2020.00023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Athar, Shahrukh, Muhammad Ali Siddiqi, and Shahid Masud. "Design and FPGA Implementation of a 2nd Order Adaptive Delta Sigma Modulator with One Bit Quantization." In 2010 International Conference on Field Programmable Logic and Applications (FPL 2010). IEEE, 2010. http://dx.doi.org/10.1109/fpl.2010.82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lakemeyer, Gerhard, and Hector J. Levesque. "A First-Order Logic of Limited Belief Based on Possible Worlds." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/62.

Full text
Abstract:
In a recent paper Lakemeyer and Levesque proposed a first-order logic of limited belief to characterize the beliefs of a knowledge base (\KB). Among other things, they show that their model of belief is expressive, eventually complete, and tractable. This means, roughly, that a \KB\ may consist of arbitrary first-order sentences, that any sentence which is logically entailed by the \KB\ is eventually believed, given enough reasoning effort, and that reasoning is tractable under reasonable assumptions. One downside of the proposal is that epistemic states are defined in terms of sets of clauses
APA, Harvard, Vancouver, ISO, and other styles
5

Console, Marco, Paolo Guagliardo, and Leonid Libkin. "Do We Need Many-valued Logics for Incomplete Information?" 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/851.

Full text
Abstract:
One of the most common scenarios of handling incomplete information occurs in relational databases. They describe incomplete knowledge with three truth values, using Kleene's logic for propositional formulae and a rather peculiar extension to predicate calculus. This design by a committee from several decades ago is now part of the standard adopted by vendors of database management systems. But is it really the right way to handle incompleteness in propositional and predicate logics? Our goal is to answer this question. Using an epistemic approach, we first characterize possible levels of part
APA, Harvard, Vancouver, ISO, and other styles
6

Dharne, Avinash G., and Suhada Jayasuriya. "Robot Localization Using Fuzzy Logic." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-81052.

Full text
Abstract:
Robot Localization is an issue of vital importance for the functioning of autonomous mobile robots. Location information, allows a robot to navigate complex environments and perform local tasks successfully. In mobile sensor networks, this information facilitates important functions like topology control, collision avoidance and development and security of routing protocols. This issue can be divided into the problems of global position estimation, and once that is achieved, of local position tracking. To tackle these, two distinct methods have been used in the past. One is the use of speciali
APA, Harvard, Vancouver, ISO, and other styles
7

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 text
Abstract:
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 met
APA, Harvard, Vancouver, ISO, and other styles
8

Movahed, Saeid, Mohammad Eghtesad, and Reza Kamali. "Fuzzy Logic Approach for Controlling Temperature in Electroosmotic Flow Fields." In ASME 2009 7th International Conference on Nanochannels, Microchannels, and Minichannels. ASMEDC, 2009. http://dx.doi.org/10.1115/icnmm2009-82201.

Full text
Abstract:
By entering technology to the area of micro and nano scales, the design and fabrication of miniaturized instruments such as microelectronic devices, MEMS, NEMS and ..., become very desirable. Many of these devices deal with flow field in micro- and nano-channels. By decreasing the dimensions of channels, the influence of surface effects becomes prominent and cannot be ignored. One of the most charismatic categories of these phenomena is elecrokinetic effect which can result in electroosmotic flow field (EOF) that has many advantages such as being vibration free, being much more compact, having
APA, Harvard, Vancouver, ISO, and other styles
9

Schwering, Christoph. "A Reasoning System for a First-Order Logic of Limited Belief." 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/173.

Full text
Abstract:
Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning decidable or even tractable. While a number of such logics have been proposed in the past, they tend to remain for theoretical analysis only and their practical relevance is very limited. In this paper, we aim to go beyond the theory. Building on earlier work by Liu, Lakemeyer, and Levesque, we develop a logic of limited belief that is highly expressive but
APA, Harvard, Vancouver, ISO, and other styles
10

Dambrosio, Lorenzo. "Data-Tuned Fuzzy Logic Controller Applied to a Horizontal Axis Wind System." In ASME Turbo Expo 2020: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/gt2020-15815.

Full text
Abstract:
Abstract This paper deals with the control problem concerning the output voltage frequency and amplitude regulation of a wind system power plant not connected to the supply grid. The wind system configuration includes a horizontal-axis wind-turbine which drives a synchronous generator. An appropriate modeling approach has been adopted for both the wind-turbine and the synchronous generator. The proposed controller makes use of the fuzzy logic environment in order to take advantage of the wind plant system informations integrated into a limited number of equilibrium condition points (input vari
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "One order logic"

1

Archer, Myla M., Ben L. DiVito, and Cesar Munoz. Proceedings STRATA 2003. First International Workshop on Design and Application of Strategies/Tactics in Higher Order Logics; Focus on PVS Experiences. Defense Technical Information Center, 2003. http://dx.doi.org/10.21236/ada418902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Khomenko, Tetiana. TIME AND SPACE OF HISTORICAL PARALLELS OF EUGEN SVERSTIUK’S JOURNALISM. Ivan Franko National University of Lviv, 2021. http://dx.doi.org/10.30970/vjo.2021.50.11095.

Full text
Abstract:
The article is dedicated to the investigation of time-space measurements of journalistic works of Eugen Sverstiuk, a well-known Ukrainian journalist. In particular, the time-space continuum of his works is being discussed, which is characterized as comprehensive, continuous, filled with archetypical images which metaphorize the text, but at the same time structure it, and are beaded on the axis of time and documentarily located in the space. The logics of images initiated in the text is exaggerated by constant dwelling of the author in the time-space dimensions of the epoque, of which he was a
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography