Academic literature on the topic 'Disjunctions'
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 'Disjunctions.'
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 "Disjunctions"
RINALDI, DAVIDE, PETER SCHUSTER, and DANIEL WESSEL. "ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION." Bulletin of Symbolic Logic 23, no. 2 (June 2017): 181–200. http://dx.doi.org/10.1017/bsl.2017.13.
Full textRinaldi, Davide, Peter Schuster, and Daniel Wessel. "Eliminating disjunctions by disjunction elimination." Indagationes Mathematicae 29, no. 1 (February 2018): 226–59. http://dx.doi.org/10.1016/j.indag.2017.09.011.
Full textTschumi, Bernard. "Disjunctions." Perspecta 23 (1987): 108. http://dx.doi.org/10.2307/1567111.
Full textDonoghue, Michael J., and Stephen A. Smith. "Patterns in the assembly of temperate forests around the Northern Hemisphere." Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences 359, no. 1450 (October 29, 2004): 1633–44. http://dx.doi.org/10.1098/rstb.2004.1538.
Full textWILLIAMSON, MARK. "Oceanic disjunctions." Nature 351, no. 6322 (May 1991): 106. http://dx.doi.org/10.1038/351106c0.
Full textZaki, Mohammed J., Naren Ramakrishnan, and Lizhuang Zhao. "Mining Frequent Boolean Expressions." International Journal of Knowledge Discovery in Bioinformatics 1, no. 3 (July 2010): 68–96. http://dx.doi.org/10.4018/jkdb.2010070105.
Full textCrawford, Daniel, Nam Lee, and Tod Stuessy. "Plant Species Disjunctions." Aliso 13, no. 2 (1992): 395–409. http://dx.doi.org/10.5642/aliso.19921302.10.
Full textBroxvall, Mathias, Peter Jonsson, and Jochen Renz. "Disjunctions, independence, refinements." Artificial Intelligence 140, no. 1-2 (September 2002): 153–73. http://dx.doi.org/10.1016/s0004-3702(02)00224-2.
Full textChevallier, Coralie, Ira A. Noveck, Tatjana Nazir, Lewis Bott, Valentina Lanzetti, and Dan Sperber. "Making disjunctions exclusive." Quarterly Journal of Experimental Psychology 61, no. 11 (November 2008): 1741–60. http://dx.doi.org/10.1080/17470210701712960.
Full textGalindo-Legaria, César A. "Outerjoins as disjunctions." ACM SIGMOD Record 23, no. 2 (June 1994): 348–58. http://dx.doi.org/10.1145/191843.191908.
Full textDissertations / Theses on the topic "Disjunctions"
Schmidt, Mimmi. "Land Disjunctions; A historical survey." Thesis, KTH, Fastigheter och byggande, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-147648.
Full textDenna rapport redovisar ett examensarbete som syftat till att genom en litteraturstudie kart-lägga ett äldre jorddelningsinstitut, jordavsöndring. Jordavsöndring var ett jorddelningsinstitut, som fanns i svensk lagstiftning åren 1827-1928. Innan dess förekom också jorddelning som liknade jordavsöndring, men det var i allmänhet förbjudet att dela jord eftersom staten var beroende av skatteintäkter från jordägarna. Jordavsöndring gick, något generaliserat, till så att en person genom ett avtal sålde ett bestämt markområde till en annan. Med detta markområde – avsöndringslägenheten, jordavsöndring-en, avsöndringslotten – följde inte något mantal i byn och heller ingen skattskyldighet. För att inte minska skattekraften i stamfastigheten var köparen skyldig att betala en årlig avgift till säljaren. Den här avgiften skulle godkännas av länsstyrelsen, och köparen skulle söka lagfart för att få överlåtelsen godkänd. Dessa godkännanden var länge den enda kontrollen som gjordes vid avsöndring. Lantmätares inblandning blev inte en nödvändig del i avsöndringsprocessen för-rän år 1918. Jordavsöndringsinstitutet togs bort 1928, men fastigheter som avsöndrats innan dess är själv-ständiga fastigheter som alla andra. Det innebär att de blir berörda av lantmäteriförrättningar precis som alla andra fastigheter ibland blir. Vid bestämning av gränser till en avsöndrad fastighet ska överlåtelsehandlingar, innehav, och andra omständigheter användas för att söka syftet med avsöndringen. Det avtal som säljare och köpare tecknade är den viktigaste beviskällan när man ska utreda vad som ingår i en av-söndrad fastighet. Tyvärr erbjuder avtalen inte alltid svar på de frågor som kan uppstå med tiden. Kartor har inte alltid upprättats, och även när de har upprättats så är de inte alltid till hjälp. Kvar står sedan innehav och andra omständigheter att ge ledtrådar om vad syftet en gång kan ha varit. De frågetecken som uppstår när en avsöndring ska utredas rör ofta gränser, vattenområden och rätt till fiske samt rättigheter och samfälligheter. Frågan om vattenområdens tillhörighet för avsöndringar har varit särskilt omtvistad. Praxis har utvecklats till att det inte finns någon presumtionsregel, även om det har varit på förslag och i perioder har tillämpats. Det finns ett antal typfall där vatten och fiske principiellt kan anses ha ingått vid avsöndring.
SILVA, Marcos Aurélio Almeida da. "CHORD: constraint handling object-oriented rules with disjunctions." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1955.
Full textCoordenação de Aperfeiçoamento de Pessoal de Nível Superior
Constraint Handling Object-oriented Rules with Disjunctions (CHORD), é uma extensão orientada a objetos (OO) de CHRv, uma linguagem relacional baseada em regras que foi inicialmente desenhada para a especificação em caixa branca de resolvedores de restrições mas veio a mostrar-se uma linguagem bastante flexível. Flexibilidade esta que vêm sendo demonstrada nos últimos anos pelo grande número de serviços de raciocínio e algoritmos que foram descritos concisamente por meio desta linguagem. Para definir a sintaxe de nossa extensão, nós nos baseamos na abordagem seguida na extensão de Prolog realizada por Frame Logic que é similar à nossa, na qual, a sintaxe de frames foi introduzida para representar construtores OO em cima dos relacionais originais. Além disso, em vez de forçar o usuário (programador) a se adequar à uma semântica pré-definida para esses novos construtores, nós escolhemos uma estratégia inovadora: desacoplar a sintaxe da semântica da linguagem permitindo que o conjunto de hipóteses semânticas seja totalmente configurável. Estes avanços claramente contribuem para o domínio do Raciocínio Automático e da Representação do Conhecimento (AR/KR), dentro do qual CHRv é a linguagem de representa ção do conhecimento mais versátil. Este trabalho também permite a integração dos serviços de raciocínio já providos por CHRv ao estado da arte em linguagens orientadas a objetos reduzindo a quebra de paradigma entre elas. Há também contribuições a outros domínios: em programação declarativa, ao disponibilizar a primeira linguagem a integrar as formas mais poderosas de programação orientada a objetos, baseada em regras e baseada em restrições. No domínio da Web Semântica, nós mostramos que nossa linguagem generaliza a semântica de três dos mais importantes padrões de linguagem de representação do conhecimento, provendo uma solução para o problema recorrente de integração nesta área. No domínio da engenharia guiado por modelos (MDE), este trabalho provê o primeiro mapeamento semântico para modelos UML/OCL, MOF/OCL e transformações de modelo explícitamente configurável e com fundamentação axiomática declarativa e operacional em CFOL. Neste trabalho nós apresentamos as sintaxes abstrata e contreta de CHORD, suas semânticas operacional e declarativa em CFOL, e uma ontologia de hipóteses semânticas para herança. Para validá-lo, nós apresentamos três estudos de caso mostrando que CHORD generaliza UML/OCL, Frame Logic e OWL
Li, Huisong. "Shape abstractions with support for sharing and disjunctions." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEE060.
Full textShape analyses rely on expressive families of logical properties to infer complex structural invariants, such that memory safety, structure preservation and other memory properties of programs dealing with dynamic data structures can be automatically verified. Many such analyses manipulate abstract memory states that consist of separating conjunctions of basic predicates describing atomic blocks or summary predicates that describe unbounded heap regions like lists or trees using inductive definitions. Moreover, they use finite disjunctions of abstract memory states in order to take into account dissimilar shapes. Although existing analyses enable local reasoning of memory regions, they do, however, have the following issues: (1) The summary predicates are not expressive enough to describe precisely all the dynamic data structures. In particular, a fairly large number of data structures with unbounded sharing, such as graphs, cannot be described inductively in a local manner; (2) Abstract operations that read or write into summaries rely on materialization of memory cells. The materialization operation in general creates new disjunctions, yet the size of disjunctions should be kept small for the sake of efficiency. However, local predicates are not enough to determine the right set of disjuncts that should be clumped together and to define precise abstract join and widen operations. In this thesis, we study separating conjunction-based shape predicates and the related abstract operations, in particular, abstract joining and widening operations that lead to critical modifications of abstract states. We seek a lightweight way to enable some global reasoning in existing shape analyses such that shape predicates are more expressive for abstracting data structures with unbounded sharing and disjuncts can be clumped precisely and efficiently. We propose a shape abstraction based on set variables that when integrated with inductive definitions enables the specification and shape analysis of structures with unbounded sharing. We implemented the shape analysis domain by combining a separation logic-based shape abstract domain of the MemCAD analyzer and a set abstract domain, where the set abstractions are used to track unbounded pointer sharing properties. Based on this abstract domain, we analyzed a group of programs dealing with adjacency lists of graphs. We design a general semantic criterion to clump abstract memory states based on their silhouettes that express global shape properties, \ie, clumping abstract states when their silhouettes are similar. Silhouettes apply not only to the conservative union of disjuncts but also to the weakening of separating conjunctions of memory predicates into inductive summaries. Our approach allows us to define union and widening operators that aim at preserving the case splits that are required for the analysis to succeed. We implement this approach in the MemCAD analyzer and evaluate it on real-world C libraries for different data structures, including doubly-linked lists, red-black trees, AVL-trees and splay-trees. The experimental results show that our approach is able to keep the size of disjunctions small for scalability and preserve case splits that takes into account dissimilar shapes for precision
McBane, Barbara. "Asynchronicities: sound-image disjunctions, deviant meanings, and Euro-American cinema /." Diss., Digital Dissertations Database. Restricted to UC campuses, 2007. http://uclibs.org/PID/11984.
Full textVigilante, Maria Carleton University Dissertation Political Science. "Bodies of language and languages of power; feminism and its disjunctions." Ottawa, 1987.
Find full textMaharaj, Shakira. "Disjunctions and convergences: a study of stakeholders' perceptions of public participation in service delivery in Cape Town's Blikkiesdorp." Master's thesis, University of Cape Town, 2012. http://hdl.handle.net/11427/11964.
Full textIncludes bibliographical references.
This study aimed to investigate the disjunctions and convergences between key stakeholder groups' perceptions of a public participatory relationship between The City of Cape Town Municipality and the Blikkiesdorp community. The key instruments for this research were semi-structured interviews, observation periods and documentary sources which included The White Paper on Local Government (1998), The Batho Pele Handbook (2009) and the National Policy Framework of Public Participation (2007). This analysis was conducted on a single case study in order to gain in-depth information about key stakeholder perceptions.
Belluigi, Dina Zoe. "Excavating the 'critique' : an investigation into disjunctions between the espoused and the practiced within a Fine Art studio practice curriculum." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1003413.
Full textCarter, Matthew. "Perceptions and disjunctions in urban space exegesis submitted in partial fulfilment of the requirements for the degree of Master of Art & Design, AUT University, 2009 /." Click here to access this resource online, 2009. http://hdl.handle.net/10292/794.
Full textJi, Zheng. "Disjunction of narrative space." Virtual Press, 2004. http://liblink.bsu.edu/uhtbin/catkey/1305455.
Full textDepartment of Architecture
Feng, Yu. "Disjunction of Regular Timing Diagrams." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-theses/1059.
Full textBooks on the topic "Disjunctions"
Symposium on "Tropical Intercontinental Disjunctions: Gondwana Breakup, Immigration from the Boreotropics, and Transoceanic Dispersal" (2002 University of Wisconsin, Madison). Tropical Intercontinental Disjunctions. Chicago, IL: University of Chicago Press, 2004.
Find full textMcLean, George F., Charles Taylor, and José Casanova. Church and people: Disjunctions in a secular age. Washington, D.C: Council for Research in Values and Philosophy, 2012.
Find full textHolston, James. Insurgent citizenship: Disjunctions of democracy and modernity in Brazil. Princeton: Princeton University Press, 2008.
Find full textHolston, James. Insurgent citizenship: Disjunctions of democracy and modernity in Brazil. Princeton, NJ: Princeton University Press, 2007.
Find full textCitation and precedent: Conjunctions and disjunctions of German law and literature. New York: Continuum, 2011.
Find full textBook chapters on the topic "Disjunctions"
Manlove, Colin. "Disjunctions." In Critical Thinking, 107–20. London: Macmillan Education UK, 1989. http://dx.doi.org/10.1007/978-1-349-20194-5_7.
Full textManlove, Colin. "Multiple Disjunctions." In Critical Thinking, 137–57. London: Macmillan Education UK, 1989. http://dx.doi.org/10.1007/978-1-349-20194-5_9.
Full textKuhad, Urvashi. "Contradictions through disjunctions." In Science Fiction and Indian Women Writers, 148–54. London: Routledge India, 2021. http://dx.doi.org/10.4324/9781003058328-5.
Full textBalas, Egon. "Cuts from General Disjunctions." In Disjunctive Programming, 145–93. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00148-3_11.
Full textKwe, Stephen. "Learning disjunctions of features." In Lecture Notes in Computer Science, 401–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63577-7_57.
Full textKoubarakis, Manolis. "Tractable disjunctions of linear constraints." In Lecture Notes in Computer Science, 297–307. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61551-2_82.
Full textSalaita, Steven. "Conclusion Multicultural and Monocultural Disjunctions." In Arab American Literary Fictions, Cultures, and Politics, 143–53. New York: Palgrave Macmillan US, 2007. http://dx.doi.org/10.1057/9780230603370_6.
Full textRalbovský, Martin, and Tomáš Kuchař. "Using Disjunctions in Association Mining." In Advances in Data Mining. Theoretical Aspects and Applications, 339–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73435-2_27.
Full textVennekens, Joost, Sofie Verbaeten, and Maurice Bruynooghe. "Logic Programs with Annotated Disjunctions." In Logic Programming, 431–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27775-0_30.
Full textRoy, Indrajit. "Disjunctions of democracy and liberalism." In Civility in Crisis, 54–72. First Edition. | New York : Taylor & Francis Group, 2020.: Routledge India, 2020. http://dx.doi.org/10.4324/9781003089810-4.
Full textConference papers on the topic "Disjunctions"
Kanza, Yaron, and Yehoshua Sagiv. "Computing full disjunctions." In the twenty-second ACM SIGMOD-SIGACT-SIGART symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/773153.773162.
Full textGalindo-Legaria, César A. "Outerjoins as disjunctions." In the 1994 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/191839.191908.
Full textChoi, Dong-Hoon, and Lawrence J. Henschen. "ON EXCLUSIVE DISJUNCTIONS IN DEDUCTIVE DATABASE." In Proceedings of the 3rd International Symposium on Database Systems for Advanced Applications. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814503730_0040.
Full textLu, Shen, Nathan B. Schroeder, and Harrison M. Kim. "Hybrid Power/Energy Generation System Design Through Multistage Design Optimization Problem With Complementarity Constraints." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28362.
Full textViswanath, Navin, and Rajshekhar Sunderraman. "Handling disjunctions in open world relational databases." In NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society. IEEE, 2008. http://dx.doi.org/10.1109/nafips.2008.4531248.
Full textCohen, Sara, and Yehoshua Sagiv. "An incremental algorithm for computing ranked full disjunctions." In the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1065167.1065180.
Full textRajaraman, Anand, and Jeffrey D. Ullman. "Integrating information by outerjoins and full disjunctions (extended abstract)." In the fifteenth ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/237661.237717.
Full textCarral, David, Irina Dragoste, and Markus Krötzsch. "Detecting Chase (Non)Termination for Existential Rules with Disjunctions." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/128.
Full textNakano, Mikio, and Akira Shimazu. "Translating a unification grammar with disjunctions into logical constraints." In the 36th annual meeting. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/980691.980723.
Full textNakano, Mikio, and Akira Shimazu. "Translating a unification grammar with disjunctions into logical constraints." In the 17th international conference. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/980432.980723.
Full textReports on the topic "Disjunctions"
Yates, Chris. Gender policy disjunction in education in Kenya: silence, spaces and the implications of vacuum. Institute of Education, University of London, 2009. http://dx.doi.org/10.35648/20.500.12413/11781/ii059.
Full text