Relevant bibliographies by topics / Order-sorted theories

Contents

  1. Journal articles
  2. Books
  3. Book chapters

Academic literature on the topic 'Order-sorted theories'

Author: Grafiati
Published: 11 March 2023
Last updated: 31 July 2025

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 'Order-sorted theories.'

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 "Order-sorted theories"

1

Lucas, Salvador, and Raúl Gutiérrez. "Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories." Journal of Automated Reasoning 60, no. 4 (2017): 465–501. http://dx.doi.org/10.1007/s10817-017-9419-3.

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

Alpuente, María, Angel Cuenca-Ortega, Santiago Escobar, and José Meseguer. "Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*." Fundamenta Informaticae 177, no. 3-4 (2020): 297–329. http://dx.doi.org/10.3233/fi-2020-1991.

Full text
Abstract:
The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context of order-sorted rewrite theories that support symbolic execution methods modulo equational axioms. This paper generalizes the symbolic homeomorphic embedding relation to order–sorted rewrite theories that may contain various combinations of associativity and/or commutativity axioms for different binary operators. We systematically measure the performance of
APA, Harvard, Vancouver, ISO, and other styles
3

Lucas, Salvador. "Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving." Electronic Proceedings in Theoretical Computer Science 200 (December 19, 2015): 32–47. http://dx.doi.org/10.4204/eptcs.200.3.

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

Durán, Francisco, and José Meseguer. "On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories." Journal of Logic and Algebraic Programming 81, no. 7-8 (2012): 816–50. http://dx.doi.org/10.1016/j.jlap.2011.12.004.

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

Balogun, F., O. A. Wahab, and A. I. Isah. "Axiomatization multisets: a comparative analysis." Dutse Journal of Pure and Applied Sciences 9, no. 3b (2023): 155–63. http://dx.doi.org/10.4314/dujopas.v9i3b.17.

Full text
Abstract:
A multiset, unlike the classical set, allows for multiple instances of its elements. In this paper, we present a comparative analysis of theories on multisets. In particular, we examine, the first-order two-sorted multiset theory MST, and the single-sorted multiset theory MS that employs the same sort for multiplicities and the set they support. The logical strengths and significance of some axioms presented in these theories are investigated. The theory MST contains a copy of the Zermelo-Fraenkel set theory with the axiom of choice (ZFC) but is independent of ZFC. The single-sorted multiset t
APA, Harvard, Vancouver, ISO, and other styles
6

LIU, Fu-Chun. "Lawvere Theorem in Institution of Regular Order-Sorted Equational Logic and Initial (Terminal) Semantics for Its Glued Theories." Journal of Software 16, no. 7 (2005): 1205. http://dx.doi.org/10.1360/jos161205.

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

Faella, Marco, and Gennaro Parlato. "Reachability Games Modulo Theories with a Bounded Safety Player." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (2023): 6330–37. http://dx.doi.org/10.1609/aaai.v37i5.25779.

Full text
Abstract:
Solving reachability games is a fundamental problem for the analysis, verification, and synthesis of reactive systems. We consider logical reachability games modulo theories (in short, GMTs), i.e., infinite-state games whose rules are defined by logical formulas over a multi-sorted first-order theory. Our games have an asymmetric constraint: the safety player has at most k possible moves from each game configuration, whereas the reachability player has no such limitation. Even though determining the winner of such a GMT is undecidable, it can be reduced to the well-studied problem of checking
APA, Harvard, Vancouver, ISO, and other styles
8

Decker, Valerie D., Philip D. Suman, Barb J. Burge, et al. "Analysis of Social Work Theory Progression Published in 2004." Advances in Social Work 8, no. 1 (2007): 81–103. http://dx.doi.org/10.18060/133.

Full text
Abstract:
The authors reviewed 67 articles that discussed and/or tested human behavior theories from social work journals published in 2004 in order to assess the level and quality of theory progression. The articles were further sorted into Council on Social Work Education (CSWE) Educational Policy and Accreditation Standards (EPAS) Foundation Curriculum content areas of HBSE, practice, policy, field education, values & ethics, diversity, populations-at-risk/social and economic justice, and research for purposes of categorization. Results indicated that HBSE and practice were by far the largest gro
APA, Harvard, Vancouver, ISO, and other styles
9

ALPUENTE, M., S. ESCOBAR, J. SAPIÑA, and A. CUENCA-ORTEGA. "Inspecting Maude variants withGLINTS." Theory and Practice of Logic Programming 17, no. 5-6 (2017): 689–707. http://dx.doi.org/10.1017/s147106841700031x.

Full text
Abstract:
AbstractThis paper introducesGLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational unification for convergent theories modulo axioms such as associativity, commutativity, and identity. This novel equational unification relies on built-in generation of the set ofvariantsof a termt, i.e., the canonical form oftσ for a computed substitution σ. Variant generation relies on a novel narrowing strategy calledfolding variant narrowingthat opens
APA, Harvard, Vancouver, ISO, and other styles
10

Liang, Wanying, and Ruei-Yuan Wang. "A Change Analysis of Land Use and Carbon Storage in Maoming Based on the InVEST Model and GIS." International Journal of Environment, Agriculture and Biotechnology 8, no. 4 (2023): 078–94. http://dx.doi.org/10.22161/ijeab.84.10.

Full text
Abstract:
With the increasing attention paid to ecological and environmental issues, the monitoring and exploration of carbon storage have become increasingly important in ecosystems, attracting numerous attentions from academia and industry. Based on the era background of "double carbon", this study first discussed and sorted out the relevant theories, analyzed the changes and characteristics of various categories in the study area based on land use data, and analyzed the spatial-temporal changes of carbon storages in Maoming City from 1980 to 2020 through transfer matrix and dynamic degree analysis an
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Order-sorted theories"

1

Bell, John L. Categorical Logic and Model Theory. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198748991.003.0007.

Full text
Abstract:
The chapter begins with an introduction describing the development of categorical logic from the 1960s. The next section, `Categories and Deductive Systems’, describes the relationship between categories and propositional logic, while the ensuing section, `Functorial Semantics’, is devoted to Lawvere’s provision of the first-order theory of models with a categorical formulation. In the section `Local Set Theories and Toposes’ the categorical counterparts—toposes—to higher-order logic are introduced, along with their associated theories—local set theories. In the section `Models of First-Order
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Order-sorted theories"

1

Stell, John G. "Unique-sort order-sorted theories : A description as monad morphisms." In Conditional and Typed Rewriting Systems. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54317-1_107.

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

Lucas, Salvador, and José Meseguer. "Strong and Weak Operational Termination of Order-Sorted Rewrite Theories." In Rewriting Logic and Its Applications. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12904-4_10.

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

Durán, Francisco, and José Meseguer. "A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories." In Rewriting Logic and Its Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16310-4_7.

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

Toledo, Guilherme V., Yoni Zohar, and Clark Barrett. "Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness." In Automated Deduction – CADE 29. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_30.

Full text
Abstract:
AbstractWe make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable infiniteness, smoothness, convexity, finite witnessability, and strong finite witnessability (and therefore politeness and strong politeness as well). All of our examples are sharp, in the sense that we also offer proofs that no theories are available within simpler signatures. This table significantly progresses the current understanding of the various pro
APA, Harvard, Vancouver, ISO, and other styles
5

Faella, Marco, and Gennaro Parlato. "A Unified Automata-Theoretic Approach to LTLf Modulo Theories." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2024. http://dx.doi.org/10.3233/faia240622.

Full text
Abstract:
We present a novel automata-based approach to address linear temporal logic modulo theory (LTLfMT) as a specification language for data words. LTLfMT extends LTLf by replacing atomic propositions with quantifier-free multi-sorted first-order formulas interpreted over arbitrary theories. While standard LTLf is reduced to finite automata, we reduce LTLfMT to symbolic data-word automata (SDWAs), whose transitions are guarded by constraints from underlying theories. Both the satisfiability of LTLfMT and the emptiness of SDWAs are undecidable, but the latter can be reduced to a system of constraine
APA, Harvard, Vancouver, ISO, and other styles
6

Fan Tuan-Fang, Liau Churn-Jung, and Liu Duen-Ren. "Definability in Logic and Rough Set Theory." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2008. https://doi.org/10.3233/978-1-58603-891-5-749.

Full text
Abstract:
Rough set theory is an effective tool for data mining. According to the theory, a concept is definable if it can be written as a Boolean combination of equivalence classes induced from classification attributes. On the other hand, definability in logic has been explicated by Beth's theorem. In this paper, we propose two data representation formalisms, called first-order data logic (FODL) and attribute value-sorted logic (AVSL), respectively. Based on these logics, we explore the relationship between logical definability and rough set definability.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Order-sorted theories' for particular source types:
Journal articles
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