Relevant bibliographies by topics / Unification

Contents

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

Academic literature on the topic 'Unification'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 September 2024

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 'Unification.'

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 "Unification"

1

Otto, Friedrich, Paliath Narendran, and Daniel J. Dougherty. "Equational unification, word unification, and 2nd-order equational unification." Theoretical Computer Science 198, no. 1-2 (May 1998): 1–47. http://dx.doi.org/10.1016/s0304-3975(97)00130-8.

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

AMATO, GIANLUCA, and FRANCESCA SCOZZARI. "Optimality in goal-dependent analysis of Sharing." Theory and Practice of Logic Programming 9, no. 05 (July 31, 2009): 617–89. http://dx.doi.org/10.1017/s1471068409990111.

Full text
Abstract:
AbstractWe face the problems of correctness, optimality, and precision for the static analysis of logic programs, using the theory of abstract interpretation. We propose a framework with a denotational, goal-dependent semantics equipped with two unification operators for forward unification (calling a procedure) and backward unification (returning from a procedure). The latter is implemented through a matching operation. Our proposal clarifies and unifies many different frameworks and ideas on static analysis of logic programming in a single, formal setting. On the abstract side, we focus on the domainsharingby Jacobs and Langen (The Journal of Logic Programming, 1992, vol. 13, nos. 2–3, pp. 291–314) and provide the best correct approximation of all the primitive semantic operators, namely, projection, renaming, and forward and backward unifications. We show that the abstract unification operators are strictly more precise than those in the literature defined over the same abstract domain. In some cases, our operators are more precise than those developed for more complex domains involving linearity and freeness.
APA, Harvard, Vancouver, ISO, and other styles
3

MALOUF, ROBERT, JOHN CARROLL, and ANN COPESTAKE. "Efficient feature structure operations without compilation." Natural Language Engineering 6, no. 1 (March 2000): 29–46. http://dx.doi.org/10.1017/s1351324900002382.

Full text
Abstract:
One major obstacle to the efficient processing of large wide coverage grammars in unification-based grammatical frameworks such as HPSG is the time and space cost of the unification operation itself. In a grammar development system it is not appropriate to address this problem with techniques which involve lengthy compilation, since this slows down the edit-test-debug cycle. Nor is it possible to radically restructure the grammar. In this paper, we describe novel extensions to an existing efficient unification algorithm which improve its space and time behaviour (without affecting its correctness) by substantially increasing the amount of structure sharing that takes place. We also describe a fast and automatically tunable pre-unification filter (the ‘quick check’) which in practice detects a large proportion of unifications that if performed would fail. Finally, we present an efficient algorithm for checking for subsumption relationships between two feature structures; a special case of this gives a fast equality test. The subsumption check is used in a parser (described elsewhere in this issue) which ‘packs’ local ambiguities to avoid performing redundant sub-computations.
APA, Harvard, Vancouver, ISO, and other styles
4

A’Hearn, Brian, and Valeria Rueda. "Internal Borders and Population Geography in the Unification of Italy." Journal of Economic History 83, no. 3 (August 31, 2023): 747–85. http://dx.doi.org/10.1017/s0022050723000256.

Full text
Abstract:
We offer new evidence on the spatial economic impact of Italian unification. Adopting municipal population as a proxy for local economic activity, we construct a new geocoded dataset spanning the pre- and post-unification periods and discover robust evidence of an acceleration in growth near the former borders. A disproportionate improvement in market access boosted growth in these locations when barriers to trade were dismantled. Indirectly, unification’s decisive contribution to intraregional market integration, local specialization and exchange, and economic development is revealed.
APA, Harvard, Vancouver, ISO, and other styles
5

김강녕. "Korea’s Unification Tax and Unification Cost." Journal of Northeast Asia Research 25, no. 1 (August 2010): 47–76. http://dx.doi.org/10.18013/jnar.2010.25.1.003.

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

Ham, Kyu Jin. "On Justification of Unification as Basis of Unification Movements and Unification Education." Journal of the Humanities for Unification 68 (December 31, 2016): 383. http://dx.doi.org/10.21185/jhu.2016.12.68.383.

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

Jang, Seong-Ho. "Task of Preparing Unification and Juveniles Unification Education for Future of Unification." Journal of Social Science 26, no. 4 (October 31, 2015): 321. http://dx.doi.org/10.16881/jss.2015.10.26.4.321.

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

SungJangHwan. "Implication from German Unification for Korean Unification." KOREAN ELEMENTARY MORAL EDUCATION SOCIETY ll, no. 50 (December 2015): 137–64. http://dx.doi.org/10.17282/ethics.2015..50.137.

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

Domenjoud, Eric. "AC Unification Through Order-Sorted AC1 Unification." Journal of Symbolic Computation 14, no. 6 (December 1992): 537–56. http://dx.doi.org/10.1016/s0747-7171(19)80001-9.

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

Clavelli, L., and P. W. Coulter. "Grand unification scale effects in supersymmetric unification." Physical Review D 51, no. 7 (April 1, 1995): 3913–22. http://dx.doi.org/10.1103/physrevd.51.3913.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Unification"

1

Galán, García María Ángeles. "Categorical Unification." Doctoral thesis, Umeå University, Computing Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245.

Full text
Abstract:

This thesis deals with different aspects towards many-valued unification which have been studied in the scope of category theory. The main motivation of this investigation comes from the fact that in logic programming, classical unification has been identified as the provision of coequalizers in Kleisli categories of term monads. Continuing in that direction, we have used categorical instrumentations to generalise the classical concept of a term. It is expected that this approach will provide an appropriate formal framework for useful developments of generalised terms as a basis for many-valued logic programming involving an extended notion of terms.

As a first step a concept for generalised terms has been studied. A generalised term is given by a composition of monads that again yields a monad, i.e. compositions of powerset monads with the term monad provide definitions for generalised terms. A composition of monads does, however, not always produce a monad. In this sense, techniques for monads composition provide a helpful tool for our concerns and therefore the study of these techniques has been a focus of this research.

The composition of monads make use of a lot of equations. Proofs become complicated, not to mention the challenge of understanding different steps of the equations. In this respect, we have studied visual techniques and show how a graphical approach can provide the support we need.

For the purpose of many-valued unification, similarity relations, generalised substitutions and unifiers have been defined for generalised terms.

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

Wilbanks, John W. (John Winston). "Linear Unification." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc500971/.

Full text
Abstract:
Efficient unification is considered within the context of logic programming. Unification is explained in terms of equivalence classes made up of terms, where there is a constraint that no equivalence class may contain more than one function term. It is demonstrated that several well-known "efficient" but nonlinear unification algorithms continually maintain the said constraint as a consequence of their choice of data structure for representing equivalence classes. The linearity of the Paterson-Wegman unification algorithm is shown largely to be a consequence of its use of unbounded lists of pointers for representing equivalences between terms, which allows it to avoid the nonlinearity of "union-find".
APA, Harvard, Vancouver, ISO, and other styles
3

Galán, Garcia Maria Ángeles. "Categorical unification /." Umeå : Univ, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245.

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

Hum, Herbert Hing-Jing. "A linear unification processor /." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63790.

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

Astorga-Saenz, Francisco Antonio. "Coupling constants and unification." Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5668/.

Full text
Abstract:
The first part of this work gives a general background for the ideas involved in the research presented in this thesis. Coupling constants, Renor-malisation Group Equation, Grand Unified Theories (GUTs) and Super symmetry (SUSY) are briefly introduced. Following this, we analyse the unification parameters M(_GUT) and l/α(_GUT) as functions of the number of fermion families (F) and Higgs boson multiplets (S). Analytical and numerical solutions to the leading and next-to-leading order evolution equation for the couplings a, are obtained. This is done in the context of the Standard Model embedded in SU(5), SUSY SU(5) and L-R SO(IO). In all these GUTs, the first order analytical approach proves itself a useful probe to examine the structure of M(_GUT) and l/α(_GUT) in terms of the variables F and S. General trends remain the same after including second order corrections to the evolution equations. Recent precision data for the coupling constants allow more definitive conclusions to be reached. We find that restrictions on the unification parameters constrain F and S in such a way that SU(5) is ruled out by constraints on 5 (in agreement with previous results), F is severely limited in SUSY SU(5) and, unlike SUSY SU(5), an acceptable unification scenario can still be obtained when Higgs bosons are ignored in L-R SO(IO). The structures of the latter two GUTs are found to be very different although some features are common to both.
APA, Harvard, Vancouver, ISO, and other styles
6

Dalvi, Sameera. "The Bundeswehr after unification." Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340317.

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

Jansson, Henrik. "Unification in Particle Physics." Thesis, Uppsala universitet, Högenergifysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-295813.

Full text
Abstract:
During the twentieth century, particle physics developed into a cornerstone of modern physics, culminating in the Standard Model. Even though this theory has proved to be of extraordinary power, it is still incomplete in several respects. It is our aim in this bachelor thesis to discuss some possible theories beyond the Standard Model, the main focus being on Grand Unified Theories, while also taking a look at attempts of further unication via discrete family symmetry. At the heart of all these theories lies the concept of local gauge invariance, which is introduced as a fundamental principle, followed by an overview of the Standard Model itself. No theory has so far managed to unify all elementary particles and their interactions, but some interesting features are highlighted. We also give a hint at some possible paths to go in the future in the quest for a unication in particle physics.
Under 1900-talet utvecklades partikelfysiken till en av de fundamentala teorierna inom fysiken, och kom att sammanfattas i den s.k. Standardmodellen. Även om denna modell rönt exceptionella framgånger vad gäller beskrivningen av elementarpartiklar och deras växelverkan, är den fortfarande ofullständig på flera sätt. Syftet med denna kandidatuppsats är att diskutera möjliga teorier bortom Standardmodellen såsom Storförenande Teorier och diskreta familjesymmetrier vars avsikt är att koppla samman de tre familjerna av fermioner i Standardmodellen. Men först introduceras idén om lokal gaugeinvarians, vilken ligger till grund for dessa teorier, varpå en översikt av Standardmodellen följer. Ingen teori har ännu lyckats ge en helt tillfredsställande bild av elementarpartiklar och deras interaktion, men en del intressanta egenskaper hos föreslagna teorier belyses i denna uppsats. Slutligen ges en del spekulativa förslag på väger att gå i framtida försök till föreningar inom partikelfysiken.
APA, Harvard, Vancouver, ISO, and other styles
8

Degandt, Catherine. "Justice allemande et unification." Lille 2, 1996. http://www.theses.fr/1996LIL20008.

Full text
Abstract:
L'unification de la republique federale d'allemagne et de la republique democratique allemande a provoque la disparition de l'ensemble du systeme judiciaire est-allemand. Les annciennes juridictions ont progressivement laisse place aux institutions judiciaires de l'ouest, dont l'installation fut amplement facilitee par une aide massive des anciens lander occidentaux. Le personnel judiciaire a, quant a lui, subi les affres d'une vague d'epuration, qui obligea les personnes licenciees a une reconversion professionnelle (pas toujours souhaitee par les professions "d'accueil") et contraignit les personnes recrutees a une formation et une adaptation rapide, tant aux structures nouvelles qu'aux collegues venus de l'ouest, jeunes ou moins jeunes, entamant ou redemarrant une carriere. The unification of the german democratic republic with the federal republic of germany has caused all of the east german judicial system to disappear. The old jurisdictions progressively gave way to the western judicial institutions, the setting up of which was made easier to a large extent by a massive help from the old west lander. The judicial personnel was, for his part, subjected to a wave of purge which compelled the dismissed persons to a professional reconversion (not always wished by the "reception" professions) and forced the recruited persons to be trained and rapidly get used to the new structures as well as their colleagues from the west, whether young or older, beginning a career or strating it again.
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Boo-Kyoon. "Korean unification : problems and solutions /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA294327.

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

Ferrero, Elisa. "Unification of radio-loud AGN." Diss., lmu, 2005. http://nbn-resolving.de/urn:nbn:de:bvb:19-30879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Unification"

1

Kim, Young Oon. Unification theology. 2nd ed. New York, NY: Holy Spirit Association for the Unification of World Christianity, 1987.

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

Caldwell, Peter C., and Robert R. Shandley, eds. German Unification. New York: Palgrave Macmillan US, 2011. http://dx.doi.org/10.1057/9780230337954.

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

Commission, New Jersey County and Municipal Government Study. Judicial unification. [Trenton, N.J.]: The Commission, 1987.

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

Francez, Nissim. Unification grammars. Cambridge: Cambridge University Press, 2012.

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

Stephen, Brockmann, and Rabinbach Anson, eds. German unification. New York: Telos Press, 1991.

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

1946-, Masson Paul, ed. German unification. Kidlington: North-Holland, 1996.

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

Colban, Erik A. Unification algorithms. Oslo: University of Oslo, Department of Mathematics, 1990.

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

Larres, Klaus, ed. Germany since Unification. London: Palgrave Macmillan UK, 2001. http://dx.doi.org/10.1057/9780230800038.

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

Mohapatra, Rabindra N. Unification and Supersymmetry. New York, NY: Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4757-1928-4.

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

Larres, Klaus, ed. Germany since Unification. London: Palgrave Macmillan UK, 1998. http://dx.doi.org/10.1007/978-1-349-26132-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Unification"

1

Schlosshauer, Maximilian. "Unification." In The Frontiers Collection, 261–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20880-5_15.

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

Merritt, Dennis. "Unification." In Springer Compass International, 87–92. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-3426-5_10.

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

Carrillo, Rosa Antonia. "Unification." In The Relationship Factor in Safety Leadership, 80–82. Abingdon, Oxon ; New York, NY : Routledge, 2019.: Routledge, 2019. http://dx.doi.org/10.4324/9780429057694-6.

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

Salimkhani, Kian. "Unification." In The Non-Fundamentality of Spacetime, 209–40. New York: Routledge, 2023. http://dx.doi.org/10.4324/9781003404149-6.

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

Wong, M. W. "A Unification." In Wavelet Transforms and Localization Operators, 143–46. Basel: Birkhäuser Basel, 2002. http://dx.doi.org/10.1007/978-3-0348-8217-0_25.

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

Snyder, Wayne. "E-Unification." In A Proof Theory for General Unification, 49–60. Boston, MA: Birkhäuser Boston, 1991. http://dx.doi.org/10.1007/978-1-4612-0435-0_4.

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

Lassez, J. L., M. J. Maher, and K. Marriott. "Unification revisited." In Foundations of Logic and Functional Programming, 67–113. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19129-1_4.

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

Kenyon, I. R. "Electroweak unification." In Elementary Particle Physics, 148–70. Dordrecht: Springer Netherlands, 1987. http://dx.doi.org/10.1007/978-94-010-9289-0_8.

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

Deransart, Pierre, AbdelAli Ed-Dbali, and Laurent Cervoni. "Prolog Unification." In Prolog: The Standard, 11–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-61411-8_3.

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

Urban, Christian, Andrew Pitts, and Murdoch Gabbay. "Nominal Unification." In Computer Science Logic, 513–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45220-1_41.

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

Conference papers on the topic "Unification"

1

Hughes, Dominic J. D. "Unification nets." In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3209108.3209159.

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

Anantharaman, Siva, Hai Lin, Christopher Lynch, Paliath Narendran, and Michael Rusinowitch. "Cap unification." In the 5th ACM Symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1755688.1755713.

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

Coleman, John. "Unification phonology." In the 13th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1990. http://dx.doi.org/10.3115/991146.991161.

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

Chamseddine, Ali. "Geometric Unification." In Frontiers of Fundamental Physics 14. Trieste, Italy: Sissa Medialab, 2016. http://dx.doi.org/10.22323/1.224.0028.

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

Kim, Albert. "Graded unification." In the 32nd annual meeting. Morristown, NJ, USA: Association for Computational Linguistics, 1994. http://dx.doi.org/10.3115/981732.981777.

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

Godden, Kurt. "Lazy unification." In the 28th annual meeting. Morristown, NJ, USA: Association for Computational Linguistics, 1990. http://dx.doi.org/10.3115/981823.981846.

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

Jin, Ruoming, Yuri Breitbart, and Chibuike Muoh. "Data Discretization Unification." In Seventh IEEE International Conference on Data Mining (ICDM 2007). IEEE, 2007. http://dx.doi.org/10.1109/icdm.2007.35.

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

Kahane, Sylvain. "Polarized unification grammars." In the 21st International Conference. Morristown, NJ, USA: Association for Computational Linguistics, 2006. http://dx.doi.org/10.3115/1220175.1220193.

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

Shimada, Hajime, Hideki Ando, and Toshio Shimada. "Pipeline stage unification." In the 2003 international symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/871506.871587.

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

Susič, Vasja. "Minimal E6 unification." In CETUP* 2015 – WORKSHOP ON DARK MATTER, NEUTRINO PHYSICS AND ASTROPHYSICS AND PPC 2015 – IXTH INTERNATIONAL CONFERENCE ON INTERCONNECTIONS BETWEEN PARTICLE PHYSICS AND COSMOLOGY. Author(s), 2016. http://dx.doi.org/10.1063/1.4953290.

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

Reports on the topic "Unification"

1

Baader, Franz, and Klaus U. Schulz. Unification Theory - An Introduction. Aachen University of Technology, 1997. http://dx.doi.org/10.25368/2022.135.

Full text
Abstract:
Equational unification is a generalization of syntactic unification in which semantic properties of function symbols are taken into account. For example, assume that the function symbol '+' is known to be commutative. Given the unication problem x + y ≐ a + b (where x and y are variables, and a and b are constants), an algorithm for syntactic unification would return the substitution {x ↦ a; y ↦ b} as the only (and most general) unifier: to make x + y and a + b syntactically equal, one must replace the variable x by a and y by b. However, commutativity of '+' implies that {x ↦ b; y ↦ b} also is a unifier in the sense that the terms obtained by its application, namely b + a and a + b, are equal modulo commutativity of '+'. More generally, equational unification is concerned with the problem of how to make terms equal modulo a given equational theory, which specifies semantic properties of the function symbols that occur in the terms to be unified.
APA, Harvard, Vancouver, ISO, and other styles
2

Sinn, Hans-Werner. International Implications of German Unification. Cambridge, MA: National Bureau of Economic Research, November 1996. http://dx.doi.org/10.3386/w5839.

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

Sinn, Hans-Werner. Macroeconomic Aspects of German Unification. Cambridge, MA: National Bureau of Economic Research, January 1991. http://dx.doi.org/10.3386/w3596.

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

Citrin, Wayne. Parallel Unification Scheduling in Prolog. Fort Belvoir, VA: Defense Technical Information Center, September 1986. http://dx.doi.org/10.21236/ada173122.

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

Baader, Franz, and Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.

Full text
Abstract:
The Description Logic EL is an inexpressive knowledge representation language, which nevertheless has recently drawn considerable attention in the knowledge representation and the ontology community since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have shown that unification in EL is NP-complete, and thus of a complexity that is considerably lower than in other Description Logics of comparably restricted expressive power. In this paper, we introduce a new NP-algorithm for solving unification problem in EL, which is based on a reduction to satisfiability in propositional logic (SAT). The advantage of this new algorithm is, on the one hand, that it allows us to employ highly optimized state of the art SAT solverswhen implementing an EL-unification algorithm. On the other hand, this reduction provides us with a proof of the fact that EL-unification is in NP that is much simpler than the one given in our previous paper on EL-unification.
APA, Harvard, Vancouver, ISO, and other styles
6

Shieber, Stuart M., Lauri Karttunen, Fernando C. Pereira, and Martin Kay. More Notes from the Unification Underground: A Second Compilation of Papers on Unification-Based Formalisms. Fort Belvoir, VA: Defense Technical Information Center, August 1985. http://dx.doi.org/10.21236/ada461772.

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

Baader, Franz, Pavlos Marantidis, and Alexander Okhotin. Approximate Unification in the Description Logic FL₀. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.228.

Full text
Abstract:
Unification in description logics (DLs) has been introduced as a novel inference service that can be used to detect redundancies in ontologies, by finding different concepts that may potentially stand for the same intuitive notion. It was first investigated in detail for the DL FL₀, where unification can be reduced to solving certain language equations. In order to increase the recall of this method for finding redundancies, we introduce and investigate the notion of approximate unification, which basically finds pairs of concepts that “almost” unify. The meaning of “almost” is formalized using distance measures between concepts. We show that approximate unification in FL₀ can be reduced to approximately solving language equations, and devise algorithms for solving the latter problem for two particular distance measures.
APA, Harvard, Vancouver, ISO, and other styles
8

Wynnyczok, Martha-Jean H. China-Taiwan: What Kind of Unification. Fort Belvoir, VA: Defense Technical Information Center, February 1994. http://dx.doi.org/10.21236/ada440940.

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

Pal, P. B. Monopoles of SU(15) grand unification. Office of Scientific and Technical Information (OSTI), March 1991. http://dx.doi.org/10.2172/10146718.

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

Oliger, Joseph, Ramani Pichumani, and Dulce Ponceleon. A Visual Object-Oriented Unification System. Fort Belvoir, VA: Defense Technical Information Center, March 1989. http://dx.doi.org/10.21236/ada206228.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Unification' for particular source types:
Journal articles Dissertations / Theses Books
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