Relevant bibliographies by topics / Prime implicates

Contents

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

Academic literature on the topic 'Prime implicates'

Author: Grafiati
Published: 4 June 2021
Last updated: 2 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 'Prime implicates.'

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 "Prime implicates"

1

Bienvenu, M. "Prime Implicates and Prime Implicants: From Propositional to Modal Logic." Journal of Artificial Intelligence Research 36 (October 20, 2009): 71–128. http://dx.doi.org/10.1613/jair.2754.

Full text
Abstract:
Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be appropriately extended from propositional logic to the modal logic K. We begin the paper by considering a number of potential definitions of clauses and terms for K. The different definitions are evaluated with respect to a set of syntactic, semantic, and complexity-theoretic properties characteristic of the propositional definition. We then compare the definitions with respect to the properties of the notions of prime implicates and prime implicants that they induce. While there is no definition that perfectly generalizes the propositional notions, we show that there does exist one definition which satisfies many of the desirable properties of the propositional case. In the second half of the paper, we consider the computational properties of the selected definition. To this end, we provide sound and complete algorithms for generating and recognizing prime implicates, and we show the prime implicate recognition task to be PSPACE-complete. We also prove upper and lower bounds on the size and number of prime implicates. While the paper focuses on the logic K, all of our results hold equally well for multi-modal K and for concept expressions in the description logic ALC.
APA, Harvard, Vancouver, ISO, and other styles
2

Kean, Alex, and George Tsiknis. "An incremental method for generating prime implicants/implicates." Journal of Symbolic Computation 9, no. 2 (February 1990): 185–206. http://dx.doi.org/10.1016/s0747-7171(08)80029-6.

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

Schrag, Robert, and James M. Crawford. "Implicates and prime implicates in Random 3-SAT." Artificial Intelligence 81, no. 1-2 (March 1996): 199–222. http://dx.doi.org/10.1016/0004-3702(95)00053-4.

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

Echenim, Mnacho, Nicolas Peltier, and Sophie Tourret. "Prime Implicate Generation in Equational Logic." Journal of Artificial Intelligence Research 60 (December 18, 2017): 827–80. http://dx.doi.org/10.1613/jair.5481.

Full text
Abstract:
We present an algorithm for the generation of prime implicates in equational logic, that is, of the most general consequences of formulæ containing equations and disequations between first-order terms. This algorithm is defined by a calculus that is proved to be correct and complete. We then focus on the case where the considered clause set is ground, i.e., contains no variables, and devise a specialized tree data structure that is designed to efficiently detect and delete redundant implicates. The corresponding algorithms are presented along with their termination and correctness proofs. Finally, an experimental evaluation of this prime implicate generation method is conducted in the ground case, including a comparison with state-of-the-art propositional and first-order prime implicate generation tools.
APA, Harvard, Vancouver, ISO, and other styles
5

Van De Putte, F. "Prime implicates and relevant belief revision." Journal of Logic and Computation 23, no. 1 (November 7, 2011): 109–19. http://dx.doi.org/10.1093/logcom/exr040.

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

Prasad, V. C. "Quality of Minimal Sets of Prime Implicants of Boolean Functions." International Journal of Electronics and Telecommunications 63, no. 2 (June 27, 2017): 165–69. http://dx.doi.org/10.1515/eletel-2017-0022.

Full text
Abstract:
Abstract Two new problems are posed and solved concerning minimal sets of prime implicants of Boolean functions. It is well known that the prime implicant set of a Boolean function should be minimal and have as few literals as possible. But it is not well known that min term repetitions should also be as few as possible to reduce power consumption. Determination of minimal sets of prime implicants is a well known problem. But nothing is known on the least number of (i) prime implicants (ii) literals and (iii) min term repetitions , any minimal set of prime implicants will have. These measures are useful to assess the quality of a minimal set. They are then extended to determine least number of prime implicants / implicates required to design a static hazard free circuit. The new technique tends to give smallest set of prime implicants for various objectives.
APA, Harvard, Vancouver, ISO, and other styles
7

Jabbour, Said, Yue Ma, Badran Raddaoui, and Lakhdar Sais. "Quantifying conflicts in propositional logic through prime implicates." International Journal of Approximate Reasoning 89 (October 2017): 27–40. http://dx.doi.org/10.1016/j.ijar.2016.12.017.

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

Dunne, Paul E., and Trevor J. M. Bench-Capon. "The maximum length of prime implicates for instances of 3-SAT." Artificial Intelligence 92, no. 1-2 (May 1997): 317–29. http://dx.doi.org/10.1016/s0004-3702(97)00018-0.

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

Singh, Arindama, and Manoj K. Raut. "An algorithm for computing theory prime implicates in first order logic." International Journal of Information and Communication Technology 1, no. 1 (2007): 4. http://dx.doi.org/10.1504/ijict.2007.013273.

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

Matusiewicz, Andrew, Neil V. Murray, Paul Olsen, and Erik Rosenthal. "Computing prime implicates by pruning the search space and accelerating subsumption." Journal of Logic and Computation 27, no. 4 (October 16, 2015): 961–83. http://dx.doi.org/10.1093/logcom/exv071.

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

Dissertations / Theses on the topic "Prime implicates"

1

Tourret, Sophie. "Prime implicate generation in equational logic." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM006/document.

Full text
Abstract:
Ce mémoire présente le résultat de mon travail de thèse sur la génération d'impliqués premiers en logique équationnelle fermée, i.e., la génération des conséquences les plus générales de formules logiques contenants des équations et des disequations entre termes sans variables. Ce mémoire est divisé en trois parties. Tout d'abord, deux calculs de génération d'impliqués sont définis. Leur complétude pour la déduction est prouvée, ce qui signifie qu'ils sont tous deux capables de générer l'ensemble des impliqués modulo redondance d'une formule équationnelle fermée. Dans une deuxième partie, une structure de données arborescente est proposée pour stocker les impliqués générés, accompagnée d'algorithmes pour déceler les redondances et couper les branches de l'arbre lorsque c'est nécessaire. Cette structure de données est adaptée aux différents types de clauses (avec et sans symboles de fonctions, avec et sans contraintes) ainsi qu'aux différentes notions de redondance utilisées dans les calculs. En effet, chaque calcul utilise un critère de redondance légèrement différent des autres. Les preuves de correction et de terminaison des algorithmes sont fournies pour chaque algorithme. Enfin, une évaluation expérimentale des différentes méthodes de génération d'impliqués premiers est réalisée. Pour cela, un prototype de ces méthodes, écrit en Ocaml est comparé à des outils de génération d'impliqués premiers récents.Les résultats de ces expériences sont utilisés pour identifier les variantes les plus efficaces des algorithmes proposés. Les résultats sont prometteurs et dans la plupart des cas, meilleurs que ceux de l'état de l'art
The work presented in this memoir deals with the generation of prime implicates in ground equational logic, i.e., of the most general consequences of formulae containing equations and disequations between ground terms.It is divided in three parts. First, two calculi that generate implicates are defined. Their deductive-completeness is proved, meaning they can both generate all the implicates up to redundancy of equational formulae.Second, a tree data structure to store the generated implicates is proposed along with algorithms to detect redundancies and prune the branches of the tree accordingly. This data structure is adapted to the different kinds of clauses (with and without function symbols, with and without constraints) and to the various formal definitions of redundancy used in the calculi since each calculus uses different -- although similar -- redundancy criteria. Termination and correction proofs are provided with each algorithm. Finally, an experimental evaluation of the different prime implicate generation methods based on research prototypes written in Ocaml is conducted including a comparison with state-of-the-art prime implicate generation tools. This experimental study is used to identify the most efficient variants of the proposed algorithms. These show promising results overstepping the state of the art
APA, Harvard, Vancouver, ISO, and other styles
2

Franciscani, Juliana de Fátima [UNESP]. "Consenso Iterativo: geração de implicantes primos para minimização de funções booleanas com múltiplas saídas." Universidade Estadual Paulista (UNESP), 2016. http://hdl.handle.net/11449/144517.

Full text
Abstract:
Submitted by JULIANA DE FÁTIMA FRANCISCANI null (ifsp.juliana@gmail.com) on 2016-10-28T18:39:46Z No. of bitstreams: 1 Juliana de Fátima Franciscani.pdf: 3657600 bytes, checksum: dfdbe82d43ba74271de101385cdbbf6e (MD5)
Approved for entry into archive by Felipe Augusto Arakaki (arakaki@reitoria.unesp.br) on 2016-11-03T19:07:45Z (GMT) No. of bitstreams: 1 franciscani_jf_me_ilha.pdf: 3638504 bytes, checksum: 6ca7f15a8be8ef019afd3f8e0ecc1e52 (MD5)
Made available in DSpace on 2016-11-03T19:07:45Z (GMT). No. of bitstreams: 1 franciscani_jf_me_ilha.pdf: 3638504 bytes, checksum: 6ca7f15a8be8ef019afd3f8e0ecc1e52 (MD5) Previous issue date: 2016-08-31
Com a evolução e difusão do desenvolvimento de equipamentos utilizando microtecnologia e nanotecnologia, circuitos cada vez menores, mais eficientes e que consomem menos energia, são necessários. Os métodos de minimização de funções booleanas tornam-se relevantes por possibilitarem a otimização de circuitos lógicos, através da geração de circuitos que possuam a mesma funcionalidade, porém, minimizados. Estudos na área de minimização de funções booleanas são realizados há muito tempo, e estão sendo adaptados às novas tecnologias. A geração de implicantes primos de uma função booleana é um dos passos para a cobertura dos mintermos da função e, consequentemente, para a obtenção da função de custo mínimo. Neste trabalho, a Primeira Fase do Método de Quine-McCluskey para Funções Booleanas com Múltiplas Saídas (QMM) foi implementada para posterior comparação com os Métodos Propostos GPMultiplo e MultiGeraPlex (baseados na filosofia do algoritmo GeraPlex). Os métodos propostos geram os implicantes primos de uma função booleana com múltiplas saídas e utilizam a operação de consenso iterativo para comparar dois termos. Os resultados obtidos, através da comparação do GPMultiplo, MultiGeraPlex e da Primeira Fase do Método de QMM, puderam comprovar que a aplicação dos métodos propostos torna-se mais viável e vantajosa por permitir menor tempo de execução e uso de memória, menor quantidade de implicantes gerados e de comparações entre os termos.
With the evolution and spread of the development of equipment using microtechnology and nanotechnology, circuits in need are smaller, more efficient and consume less power. Methods of Minimizing Boolean Functions become important as they allow optimization of logic circuits by generating circuits having the same functionality, but minimized. Studies in Minimizing Boolean Functions area are carried out long ago, and are being adapted to new technologies. The generation of prime implicants of a Boolean function is one of the steps for covering the function of the minterms, and consequently to obtain the minimum cost function. In this work, the first phase of the Quine-McCluskey Method for Booleans Functions with Multiple Output (QMM) was implemented for comparison with Proposed Methods GPMultiplo and MultiGeraPlex (based on the philosophy of GeraPlex algorithm). The proposed methods generates the prime implicants of a Boolean Function with Multiple Output and using the iterative consensus operation to compare two terms. The results obtained by comparing the GPMultiplo, MultiGeraPlex and the first phase of the QMM Method, were able to prove that the application of the proposed methods becomes more feasible and advantageous, by allowing smaller execution time, number of implicants and number of comparisons.
APA, Harvard, Vancouver, ISO, and other styles
3

Franciscani, Juliana de Fátima. "Consenso Iterativo : geração de implicantes primos para minimização de funções booleanas com múltiplas saídas /." Ilha Solteira, 2016. http://hdl.handle.net/11449/144517.

Full text
Abstract:
Orientador: Alexandre Cesar Rodrigues Silva
Resumo: Com a evolução e difusão do desenvolvimento de equipamentos utilizando microtecnologia e nanotecnologia, circuitos cada vez menores, mais eficientes e que consomem menos energia, são necessários. Os métodos de minimização de funções booleanas tornam-se relevantes por possibilitarem a otimização de circuitos lógicos, através da geração de circuitos que possuam a mesma funcionalidade, porém, minimizados. Estudos na área de minimização de funções booleanas são realizados há muito tempo, e estão sendo adaptados às novas tecnologias. A geração de implicantes primos de uma função booleana é um dos passos para a cobertura dos mintermos da função e, consequentemente, para a obtenção da função de custo mínimo. Neste trabalho, a Primeira Fase do Método de Quine-McCluskey para Funções Booleanas com Múltiplas Saídas (QMM) foi implementada para posterior comparação com os Métodos Propostos GPMultiplo e MultiGeraPlex (baseados na filosofia do algoritmo GeraPlex). Os métodos propostos geram os implicantes primos de uma função booleana com múltiplas saídas e utilizam a operação de consenso iterativo para comparar dois termos. Os resultados obtidos, através da comparação do GPMultiplo, MultiGeraPlex e da Primeira Fase do Método de QMM, puderam comprovar que a aplicação dos métodos propostos torna-se mais viável e vantajosa por permitir menor tempo de execução e uso de memória, menor quantidade de implicantes gerados e de comparações entre os termos.
Mestre
APA, Harvard, Vancouver, ISO, and other styles
4

Sanches, Aline de Paula [UNESP]. "Emprego do método de Quine-Mccluskey estendido para gerar circuito mínimo com estruturas ESOP (XOR-XNOR)." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/151311.

Full text
Abstract:
Submitted by ALINE DE PAULA SANCHES null (alinepaulasanches@gmail.com) on 2017-08-10T04:12:51Z No. of bitstreams: 1 Defesa10_modificada 09-08-2017.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5)
Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-08-15T17:07:06Z (GMT) No. of bitstreams: 1 sanches_ap_me_ilha.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5)
Made available in DSpace on 2017-08-15T17:07:06Z (GMT). No. of bitstreams: 1 sanches_ap_me_ilha.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5) Previous issue date: 2017-07-06
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Com a disseminação de dispositivos eletrônicos cada vez menores e o advento de novas tecnologias. A busca por métodos de minimização de funções booleanas tem sido a base para eletrônica digital. Neste trabalho apresenta-se a implementação da primeira fase do método Quine-McCluskey Estendido que utiliza-se de estruturas AND-XOR-XNOR para a geração de implicantes primos. O objetivo do trabalho foi comprovar que, na maioria das vezes, a implementação de uma função Booleana utilizando expressões AND-XOR-XNOR requerem menor quantidade de termos produtos, quando comparado com implementação com expressões AND-OR. A fase de cobertura dos mintermos em ambos os métodos foi formulada como um problema de programação linear inteira 0 e 1 que através do programa Lp_solve obteve a solução de menor custo. Na comparação da eficiência dos métodos foram analisados os custos dos circuitos mínimos gerados, a quantidade de memória utilizada e o tempo de execução. Com os resultados obtidos pode-se concluir que, para a maioria dos casos executados, o método Quine-McCluskey Estendido gera uma solução de menor custo. No entanto, com relação ao desempenho computacional (tempo de execução e memória), o método Quine-McCluskey Estendido apresentou-se inferior se comparado ao Quine-McCluskey.
With the dissemination of smaller and smaller electronic devices and the advent of new technologies. The search for methods of minimizing Boolean function has been the basis for digital electronics. This work presents the implementation of the first phase of the Extended Quine-McCluskey method, which uses AND-XOR-XNOR structures to generate prime implicants. The goal of this work is to prove that, in most cases, the implementation of a Boolean function using the expressions AND-XOR-XNOR requires fewer product terms than the implementation with AND-OR expressions does. The stage of mini terms covering in both methods was formulated with the 0-1 integer linear programming problem, which obtained lower cost through the Lp_Solve program. While comparing the efficiency of these methods we analised: the costs of the minimum circuits generated, the amount of memory that has been used and the runtime. With the obtained results it is possible to conclude that, for most of the executed cases, the Extended Quine-McCluskey method generates a solution of lower cost. On the other hand, with regards to the computational performance (runtime and memory), the Extended Quine-McCluskey method has shown itself inferior when compared to the Quine-McCluskey method.
APA, Harvard, Vancouver, ISO, and other styles
5

Sanches, Aline de Paula. "Emprego do método de Quine-Mccluskey estendido para gerar circuito mínimo com estruturas ESOP (XOR-XNOR) /." Ilha Solteira, 2017. http://hdl.handle.net/11449/151311.

Full text
Abstract:
Orientador: Alexandre César Rodrigues da Silva
Resumo: Com a disseminação de dispositivos eletrônicos cada vez menores e o advento de novas tecnologias. A busca por métodos de minimização de funções booleanas tem sido a base para eletrônica digital. Neste trabalho apresenta-se a implementação da primeira fase do método Quine-McCluskey Estendido que utiliza-se de estruturas AND-XOR-XNOR para a geração de implicantes primos. O objetivo do trabalho foi comprovar que, na maioria das vezes, a implementação de uma função Booleana utilizando expressões AND-XOR-XNOR requerem menor quantidade de termos produtos, quando comparado com implementação com expressões AND-OR. A fase de cobertura dos mintermos em ambos os métodos foi formulada como um problema de programação linear inteira 0 e 1 que através do programa Lp_solve obteve a solução de menor custo. Na comparação da eficiência dos métodos foram analisados os custos dos circuitos mínimos gerados, a quantidade de memória utilizada e o tempo de execução. Com os resultados obtidos pode-se concluir que, para a maioria dos casos executados, o método Quine-McCluskey Estendido gera uma solução de menor custo. No entanto, com relação ao desempenho computacional (tempo de execução e memória), o método Quine-McCluskey Estendido apresentou-se inferior se comparado ao Quine-McCluskey.
Mestre
APA, Harvard, Vancouver, ISO, and other styles
6

Elliott, Paul Harrison 1979. "An efficient projected minimal conflict generator for projected prime implicate and implicant generation." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17766.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2004.
Includes bibliographical references (p. 109-111).
Performing real-time reasoning on models of physical systems is essential in many situations, especially when human intervention is impossible. Since many deductive reasoning tasks take memory or time that is exponential in the number of variables that appear in the model, efforts need to be made to reduce the size of the models used online. The model can be reduced without sacrificing reasoning ability by targeting the model for a specific task, such as diagnosis or reconfiguration. A model may be reduced through model compilation, an offline process where relations and variables that have no bearing on the particular task are removed. This thesis introduces a novel approach to model compilation, through the generation of projected prime implicates and projected prime implicants. Prime implicates and prime implicants compactly represent the consequences of a logical theory. Projection eliminates model variables and their associated prime implicates or implicants that do not contribute to the particular task. This elimination process reduces the size and number of variables appearing in the model and therefore the complexity of the real-time reasoning problem. This thesis presents a minimal conflict generator that efficiently generates projected prime implicates and projected prime implicants. The projected minimal conflict generator uses a generate-and-test approach, in which the candidate generator finds potential minimal conflicts that are then accepted or rejected by the candidate tester. The candidate generator uses systematic search in combination with an iterative deepening algorithm, in order to reduce the space required by the algorithm to a space that is linear in the number of variables rather than exponential.
(cont.) In order to make the algorithm more time efficient, the candidate generator prunes the search space using previously found implicants, as well as minimal conflicts, which identify the sub-spaces that contain no new minimal conflicts. The candidate tester identifies implicants of the model by testing for validity. The tester uses a clause-directed approach along with finite-domain variables to efficiently test for validity. Combined, these techniques allow the tester to test for validity without assigning a value to every variable. The conflict generator was evaluated on randomly generated models; problems in which models with 20 variables, 5 domain elements each, were projected onto 5 variables. All projected prime implicates were generated from models with 20 clauses within 2 seconds, and from models with 80 clauses within 13 seconds.
by Paul Harrison Elliott.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Simpson, Dheny Menezes. "Da mudança nos hábitos de consumo ai price value trade-off: as implicações da retração econômica no Brasil sobre o comportamento de consumo dos brasileiros." Master's thesis, 2018. http://hdl.handle.net/10284/6881.

Full text
Abstract:
Ao analisar os fatores de influência no processo de decisão de compra dos consumidores, nota-se que além dos fatores sociais e culturais, os fatores econômicos apresentam-se como principais influenciadores do comportamento, padrão e estilo de consumo expressado pelos consumidores. A proposta de investigação desta pesquisa de abordagem quantitativa é observar a relação entre um cenário econômico de recessão e a resposta comportamental dos indivíduos nas suas relações de consumo. Como objetivos investigativos, o presente estudo propôs-se a: 1) analisar os efeitos da crise econômica sobre o padrão e perfil de consumo dos consumidores; 2) identificar as áreas de consumo mais afetadas pela diminuição do comportamento de consumo dos consumidores na crise e 3) comprovar a ocorrência de Trade-off entre preço e valor no processo decisório de compra dos consumidores no cenário de crise econômica. O instrumento utilizado na coleta de dados foi um questionário constituído de 23 perguntas fechadas pelo qual se permitiu validar as hipóteses de que um panorama econômico de crise promove interferência direta sobre o mercado de consumo a partir das mudanças no padrão e comportamento de consumo dos indivíduos, tendenciados a adotar uma atitude de consumo mais consciente e cautelosa, priorizando as ofertas de preço mais atrativas, abrindo mão do valor e todos os benefícios agregados sobre o custo do produto em sua decisão de compra.
By analyzing the influence factors in consumers’ purchase-decision process, it’s noted that besides the social and cultural factors, economic factors are key influencers of behavior pattern and style of consumption expressed by consumers. The proposal of investigation of this research in a quantitative approach is to observe the relation of cause and effect between a recessionary economic scenario and the behavioral response of individuals in their consuming relations. As Investigative goals, the present study proposed to: 1) analyze along consumers the effects of economic recession scenario over income, standard and consuming profile. 2) identify the most impacted areas by the reduction in purchasing behavior of goods and services by the consumer while in crisis.3) prove the occurrence of the trade-off between price and value in the decisionmaking process of consumers’ purchase in scenarios of economic crisis. The instrument used in gathering data was a questionnaire consisting of 23 close-ended questions, which allowed validating the hypotheses that a panorama of economic crisis promotes direct interference on the consuming market from the changes in the pattern and behavior of consumption from individuals, tending to adopt a more conscious and cautious attitude of consumption, prioritizing the most attractive price offerings, giving up on the value and all aggregated benefits on the cost of the product in their purchasing decision.
APA, Harvard, Vancouver, ISO, and other styles
8

Henriques, Lailla Fabris. "Os efeitos das exportações de commodities na legislação brasileira de preço de transferência e suas implicações com o sexto método da OCDE." Master's thesis, 2016. http://hdl.handle.net/10400.14/28149.

Full text
Abstract:
O presente trabalho tem como objetivo examinar, através de uma abordagem multidisciplinar, o regime brasileiro de controle dos preços de transferência no enfoque da exportação das commodities. A abordagem será em relação às situações de aplicabilidade da legislação brasileira, e a comparabilidade da aplicação do método do cálculo em confronto com os países destinatários que em sua maioria são membros da OCDE e que possui como principal característica o princípio do “arm´s lenght” e uma metodologia mais serena e que facilita as relações entre os países. O instituto é um mecanismo de forma a evitar que sejam ocultados ou desviados lucros, sem impactar no estímulo e no desenvolvimento econômico das exportações. Ocorre que diante da especificidade da legislação brasileira que já promove impactos internos e através de duríssimas autuações, afetando a competitividade do produto nacional de forma igualitária no mercado internacional e o funcionamento da economia brasileira nos moldes internacionais. Entretanto, para consolidação da aplicação do preço de transferência no comércio exterior relativo às commodities, o empresariado necessita de uma clareza na sua visão jurídica e operacional, bem como de uma uniformização da legislação interna em consonância com as Guidelines da OCDE de modo a facilitar as relações entre países destinatários de forma segura e estável, que em sua maioria são membros da OCDE e que possuem diretrizes consolidadas ou em vias de ser. Com isso poderia o Preço de Transferência ser praticado com menos dificuldade em relação a sua administração, etapas, burocracia, procedimentos e interpretação de sua intricada legislação.
This study aims to examine, through a multidisciplinary approach, the Brazilian system of control of transfer pricing in the focus of export commodities. The approach will be in relation to situations of applicable Brazilian law, and comparable application of confrontation in the calculation method with recipient countries that are mostly members of the OECD and which has as main feature the principle of "arm's lenght" and a more serene and methodology that facilitates relations between countries. The institute is a mechanism in order to avoid being hidden or diverted profits without impacting the stimulus and economic development of exports. Is that given the specificity of the Brazilian legislation that already promotes internal impacts and legal uncertainty through draconian fines, resulting in the national product competitiveness equally in the international market and the functioning of the Brazilian economy in international mold. However, to consolidate the application of transfer pricing in foreign trade on the commodities, businesses need clarity in their legal and operational vision, a standardization of domestic legislation in line with the OECD guidelines in order to facilitate relations between recipient countries in a safe and stable manner, which mostly are members of the OECD and that have consolidated guidelines or about to be. You could transfer the price to be practiced more easily in relation to its administration, steps, bureaucracy, procedures and interpretation of its intricate legislation.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Prime implicates"

1

Baraz, Yelena. Reading Roman Pride. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780197531594.001.0001.

Full text
Abstract:
Pride is pervasive in Roman texts, as an emotion and a political and social concept implicated in ideas of power. This study examines the Roman discourse of pride from two distinct complementary perspectives. The first is based on scripts, mini-stories told to illustrate what pride is, how it arises and develops, and where it fits within the Roman emotional landscape. The second is semantic, and draws attention to differences between terms within the pride field. The peculiar feature of Roman pride that emerges is that it appears exclusively as a negative emotion, attributed externally and condemned, up to the Augustan period. This previously unnoticed lack of expression of positive pride in republican discourse is a result of the way the Roman republican elite articulates its values as anti-monarchical and is committed, within the governing class, to power-sharing and a kind of equality. The book explores this uniquely Roman articulation of pride attributed to people, places, and institutions and traces the partial rehabilitation of pride that begins in the texts of the Augustan poets at a time of great political change. Reading for pride produces innovative readings of texts that range from Plautus to Ausonius, with a major focus on Cicero, Livy, Vergil, and other Augustan poets.
APA, Harvard, Vancouver, ISO, and other styles
2

Howard, Colin R. Arenaviruses. Oxford University Press, 2011. http://dx.doi.org/10.1093/med/9780198570028.003.0032.

Full text
Abstract:
There are few groups of viral zoonoses that have attracted such widespread publicity as the arenaviruses, particularly during the 1960’s and 1970’s when Lassa emerged as a major cause of haemorrhagic disease in West Africa. More than any other zoonoses, members of the family are used extensively for the study of virus-host relationships. Thus the study of this unique group of enveloped, single-stranded RNA viruses has been pursued for two quite separate reasons. First, lymphocytic choriomeningitis virus (LCM) has been used as a model of persistent virus infections for over half a century; its study has contributed, and continues to contribute, a number of cardinal concepts to our present understanding of immunology. LCM virus remains the prototype of the Arenaviridae and is a common infection of laboratory mice, rats and hamsters. Once thought rare in humans there is now increasing evidence of LCM virus being implicated in renal disease and as a complication in organ transplantation. Second, certain arenaviruses cause severe haemorrhagic diseases in man, notably Lassa fever in Africa, Argentine and Bolivian haemorrhagic fevers in South America, Guaranito infection in Venezuela and Chaparé virus in Bolivia. The latter is a prime example for the need of ever-continuing vigilance for the emergence of new viral diseases; over the past few years several new arenaviruses have been reported as implicated with severe human disease and indeed the number of new arenaviruses discovered since the last edition of this book have increased the size of this virus family significantly.In common with LCM, the natural reservoir of these infections is a limited number of rodent species (Howard, 1986). Although the initial isolates from South America were at first erroneously designated as newly defined arboviruses, there is no evidence to implicate arthropod transmission for any arenavirus. However, similar methods of isolation and the necessity of trapping small animals have meant that the majority of arenaviruses have been isolated by workers in the arbovirus field. A good example of this is Guaranito virus that emerged during investigation of a dengue virus outbreak in Venezuela (Salas et al. 1991).There is an interesting spectrum of pathological processes among these viruses. All the evidence so far available suggests that the morbidity of Lassa fever and South American haemorrhagic fevers due to arenavirus infection results from the direct cytopathic action of these agents. This is in sharp contrast to the immunopathological basis of ‘classic’ lymphocytic choriomeningitis disease seen in adult mice infected with LCM virus and the use of this system for elucidating the phenomenon of H2-restriction of the host cytotoxic T cell response (Zinkernagel and Doherty 1979). Despite the utility of this experimental model for dissecting the nature of the immune response to virus infection and the growing interest in arenaviruses of rodents, there remains much to be done to elucidate the pathogenesis of these infections in humans.
APA, Harvard, Vancouver, ISO, and other styles
3

Tazzara, Corey. Introduction. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198791584.003.0001.

Full text
Abstract:
Tuscany of the mid-seventeenth century was renowned for its luxury crafts and had one of the most vibrant scientific communities in Europe. The Medici family presided over a state whose political stability astonished contemporaries, in which wise rule and good fortune had spared their subjects the worst ravages associated with the Thirty Years' War. The city of Livorno was the Medici state’s greatest prize and the most innovative port in Italy. The introduction examines the development of Livorno and other free ports in three registers: as part of the Italian response to the rise of the Atlantic world; as implicated in the creation of a new kind of commodity market; and as a neglected problem in the history of economic thought. It suggests that free ports should be central to our interpretation of economic change in early modern Europe and the Mediterranean.
APA, Harvard, Vancouver, ISO, and other styles
4

Serrano, Juan. Contra el poder. Alberto Donadío y el periodismo de investigación. Sílaba Editores y Ediciones Uniandes, 2019. http://dx.doi.org/10.51566/ceper2117_30.

Full text
Abstract:
“Este es un libro que cumple con todo lo que se propone. Estaba haciendo falta en las librerías, en las mesas de noche, en los salones de clase. En Colombia son escasos los volúmenes sobre periodismo, pero son doblemente escasas las biografías que de paso cuentan el país. Este retrato preciso es ambas cosas: una serie de lecciones sobre periodismo y sobre periodismo investigativo, pero asimismo la biografía de un hombre —premiado con el Simón Bolívar a su vida y su obra— que ha visto crecer con sus propios ojos la bola de nieve de la corrupción en los tiempos en los que el oficio ha estado tratando de sacudirse el poder. Y es una verdadera rareza entre nuestras publicaciones no solo porque tiene adentro los testimonios de todos los implicados, sino porque sabe, en el momento justo, que reivindicar a Alberto Donadío es reivindicar las promesas de la democracia.” Ricardo Silva Romero “Este libro resulta sorprendentemente útil para descubrir —precisamente hoy en medio del desconcierto de la era digital—que el periodismo que se apega a su labor esencial de servir al público es capaz de sobrevivir el temporal tecnológico. La manera en que Donadío y otros de sus colegas del primer equipo investigativo de un diario en Colombia, la unidad investigativa de El Tiempo, han ejercido su labor contiene los elementos de lo que perdurará en el periodismo y esboza el futuro de lo que este será cuando muchas estructuras que hoy lo alojan se hayan derrumbado.” María Teresa Ronderos
APA, Harvard, Vancouver, ISO, and other styles
5

Sánchez Vázquez, María José. Ética, responsabilidad científica e investigación psicológica. Editorial de la Universidad Nacional de La Plata (EDULP), 2018. http://dx.doi.org/10.35537/10915/65521.

Full text
Abstract:
La presente producción corresponde a mi tesis de titulación en la Maestría de Ética Aplicada (Facultad de Filosofía y Letras, Universidad de Buenos Aires), realizada entre los años 2000 y 2005, cuyo director ha sido el profesor Dr. Carlos Cullen Soriano. La realización de la misma fue posible gracias a la obtención de un subsidio en el Programa de Becas a Docentes Universitarios del Fondo para el Mejoramiento de la Calidad (FOMEC) y la Universidad Nacional de La Plata, para la realización de posgrados en áreas de vacancia. Derroteros académico-profesionales han retrasado la aparición de este, mi primer trabajo sistemático en el área interdisciplinar entre la Ética, la Psicología y la Investigación Científica, siendo posible hoy, gracias a las oportunidades que brinda la Editorial de la Universidad Nacional de La Plata (Edulp), institución universitaria a la que pertenezco. Mi disciplina profesional es la Psicología; mi elección académica ha sido la investigación y enseñanza del proceso de investigación en sus aspectos onto-epistemológicos, metodológicos y éticos. Si bien, la tesis realizada se ha apoyado primariamente en lo epistemológico, no se trata de su única intención. Más bien, ha conformado el puntapié inicial para lanzarnos hacia las consideraciones éticas de abordar científicamente al “otro”. De todos modos, conservamos para la Psicología como disciplina, la lógica seguida para la ciencia en general, ubicándonos en una ciencia no sólo preocupada en hallar fundamentos justificacionistas (hipotético-deductivistas) respecto de sus explicaciones finales, sino también interesada en incluir los procesos interpretativos del sujeto que investiga e implicados en el intento de comprensión del fenómeno humano.
APA, Harvard, Vancouver, ISO, and other styles
6

Grant, Warren, and Martin Scott-Brown. Principles of oncogenesis. Edited by Patrick Davey and David Sprigings. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780199568741.003.0322.

Full text
Abstract:
It is obvious that the process of developing cancer—oncogenesis—is a multistep process. We know that smoking, obesity, and a family history are strong independent predictors of developing malignancy; yet, in clinics, we often see that some heavy smokers live into their nineties and that some people with close relatives affected by cancer spend many years worrying about a disease that, in the end, they never contract. For many centuries scientists have struggled to understand the process that make cancer cells different from normal cells. There were those in ancient times who believed that tumours were attributable to acts of the gods. Hippocrates suggested that cancer resulted from an imbalance between the black humour that came from the spleen, and the other three humours: blood, phlegm, and bile. It is only in the last 100 years that biologists have been able to characterize some of the pathways that lead to the uncontrolled replication seen in cancer, and subsequently examine exactly how these pathways evolve. The rampant nature by which cancer invades local and distant tissues, as well its apparent ability to spread between related individuals led some, such as Peyton Rous in 1910, to suggest that cancer was an infectious condition. He was awarded a Nobel Prize in 1966 for the 50 years of work into investigating a link between sarcoma in chickens and a retrovirus that became known as Rous sarcoma virus. He had shown how retroviruses are able to integrate sequences of DNA coding for errors in cellular replication control (oncogenes) by introducing into the human cell viral RNA together with a reverse transcriptase. Viruses are now implicated in many cancers, and in countries where viruses such as HIV and EBV are endemic, the high incidence of malignancies such as Kaposi’s sarcoma and Burkitt’s lymphoma is likely to be directly related. There are several families of viruses associated with cancer, broadly classed into DNA viruses, which mutate human genes using their own DNA, and retroviruses, like Rous sarcoma virus, which insert viral RNA into the cell, where it is then transcribed into genes. This link with viruses has not only led to an understanding that cancer originates from genetic mutations, but has also become a key focus in the design of new anticancer therapies. Traditional chemotherapies either alter DNA structure (as with cisplatin) or inhibit production of its component parts (as with 5-fluorouracil.) These broad-spectrum agents have many and varied side effects, largely due to their non-specific activity on replicating DNA throughout the body, not just in tumour cells. New vaccine therapies utilizing gene-coding viruses aim to restore deficient biological pathways or inhibit mutated ones specific to tumour cells. The hope is that these gene therapies will be effective and easily tolerated by patients, but development is currently progressing with caution. In a trial in France of ten children suffering from X-linked severe combined immunodeficiency and who were injected with a vector that coded for the gene product they lacked, two of the children subsequently died from leukaemia. Further analysis confirmed that the DNA from the viral vector had become integrated into an existing, but normally inactive, proto-oncogene, LM02, triggering its conversion into an active oncogene, and the development of life-threatening malignancy. To understand how a tiny change in genetic structure could lead to such tragic consequences, we need to understand the molecular biology of the cell and, in particular, to pay attention to the pathways of growth regulation that are necessary in all mammalian cell populations. Errors in six key regulatory pathways are known as the ‘hallmarks of cancer’ and will be discussed in the rest of this chapter.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Prime implicates"

1

Murray, Neil V., and Erik Rosenthal. "Prime Implicates and Reduced Implicate Tries." In Lecture Notes in Computer Science, 191–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04125-9_22.

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

Jackson, Peter. "Computing prime implicates incrementally." In Automated Deduction—CADE-11, 253–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55602-8_170.

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

Ramesh, Anavai, and Neil V. Murray. "Non-clausal deductive techniques for computing prime implicants and prime implicates." In Logic Programming and Automated Reasoning, 277–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56944-8_60.

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

Raut, Manoj K., Tushar V. Kokane, and Rishabh Agarwal. "Computing Theory Prime Implicates in Modal Logic." In Advances in Intelligent Systems and Computing, 273–82. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76348-4_27.

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

Kleer, Johan. "An Improved Incremental Algorithm for Generating Prime Implicates." In Logical Foundations for Cognitive Agents, 103–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-60211-5_9.

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

Echenim, Mnacho, Nicolas Peltier, and Sophie Tourret. "A Rewriting Strategy to Generate Prime Implicates in Equational Logic." In Automated Reasoning, 137–51. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08587-6_10.

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

Matusiewicz, Andrew, Neil V. Murray, and Erik Rosenthal. "Tri-Based Set Operations and Selective Computation of Prime Implicates." In Lecture Notes in Computer Science, 203–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21916-0_23.

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

Raut, Manoj K. "An Incremental Algorithm for Computing Prime Implicates in Modal Logic." In Lecture Notes in Computer Science, 188–202. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06089-7_13.

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

Matusiewicz, Andrew, Neil V. Murray, and Erik Rosenthal. "Prime Implicate Tries." In Lecture Notes in Computer Science, 250–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02716-1_19.

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

Villa, Tiziano, Timothy Kam, Robert K. Brayton, and Alberto Sangiovanni-Vincentelli. "Generalized Prime Implicants." In Synthesis of Finite State Machines, 221–43. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6155-2_7.

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

Conference papers on the topic "Prime implicates"

1

Jackson, Peter. "Computing prime implicates." In the 1992 ACM annual conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/131214.131223.

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

Dai Xu and Zuoquan Lin. "A prime implicates-based formulae forgetting." In 2011 IEEE International Conference on Computer Science and Automation Engineering (CSAE). IEEE, 2011. http://dx.doi.org/10.1109/csae.2011.5952649.

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

Jabbour, Said, Yue Ma, Badran Raddaoui, and Lakhdar Sais. "On the Characterization of Inconsistency: A Prime Implicates Based Framework." In 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2014. http://dx.doi.org/10.1109/ictai.2014.31.

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

Echenim, Mnacho, Nicolas Peltier, and Sophie Tourret. "Prime Implicate Generation in Equational Logic (extended abstract)." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/790.

Full text
Abstract:
A procedure is proposed to efficiently generate sets of ground implicates of first-order formulas with equality. It is based on a tuning of the superposition calculus, enriched with rules that add new hypotheses on demand during the proof search. Experimental results are presented, showing that the proposed approach is more efficient than state-of-the-art systems.
APA, Harvard, Vancouver, ISO, and other styles
5

To, Son Thanh, Tran Cao Son, and Enrico Pontelli. "A generic approach to planning in the presence of incomplete information: Theory and implementation (Extended Abstract)." 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/725.

Full text
Abstract:
This paper proposes a generic approach to planning in the presence of incomplete information. The approach builds on an abstract notion of a belief state representation, along with an associated set of basic operations. These operations facilitate the development of a sound and complete transition function, for reasoning about effects of actions in the presence of incomplete information, and a set of abstract algorithms for planning. The paper demonstrates how the abstract definitions and algorithms can be instantiated in three concrete representations—minimal-DNF, minimal-CNF, and prime implicates—resulting in three highly competitive conformant planners: DNF, CNF, and PIP. The paper relates the notion of a representation to that of ordered binary decision diagrams, a well-known belief state representation employed by many conformant planners, and several target compilation languages that have been presented in the literature.The paper also includes an experimental evaluation of the planners DNF, CNF, and PIP and proposes a new set of conformant planning benchmarks that are challenging for state-of-the-art conformant planners.
APA, Harvard, Vancouver, ISO, and other styles
6

Čepek, Ondřej, and Miloš Chromý. "Switch-List Representations in a Knowledge Compilation Map." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/229.

Full text
Abstract:
In this paper we focus on a less usual way to represent Boolean functions, namely on representations by switch-lists. Given a truth table representation of a Boolean function f the switch-list representation (SLR) of f is a list of Boolean vectors from the truth table which have a different function value than the preceding Boolean vector in the truth table. The main aim of this paper is to include the language SL of all SLR in the Knowledge Compilation Map [Darwiche and Marquis, 2002] and to argue, that SL may in certain situations constitute a reasonable choice for a target language in knowledge compilation. First we compare SL with a number of standard representation languages (such as CNF, DNF, and OBDD) with respect to their relative succinctness. As a by-product of this analysis we also give a short proof of a long standing open question from [Darwiche and Marquis, 2002], namely the incomparability of MODS (models) and PI (prime implicates) languages. Next we analyze which standard transformations and queries (those considered in [Darwiche and Marquis, 2002] can be performed in poly-time with respect to the size of the input SLR. We show that this collection is quite broad and the combination of poly-time transformations and queries is quite unique.
APA, Harvard, Vancouver, ISO, and other styles
7

Deharbe, David, Pascal Fontaine, Daniel Le Berre, and Bertrand Mazure. "Computing prime implicants." In 2013 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2013. http://dx.doi.org/10.1109/fmcad.2013.6679390.

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

Das, Sunil R., Abdullah-Al Amin, Satyendra N. Biswas, Mansour H. Assaf, Emil M. Petriu, and Voicu Groza. "An algorithm for generating prime implicants." In 2016 IEEE International Instrumentation and Measurement Technology Conference (I2MTC). IEEE, 2016. http://dx.doi.org/10.1109/i2mtc.2016.7520355.

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

Rosenbaum, David J., and Marek A. Perkowski. "Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID)." In 2008 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008. http://dx.doi.org/10.1109/ismvl.2008.24.

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

Lu, Peng, and James N. Siddall. "Nonlinear Programming Using Logic Methods." In ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0066.

Full text
Abstract:
Abstract The algorithm presented here combines Boolean logic analysis with heuristic search to solve the general 0-1 polynomial programming problem. It can also be extended to solve continuous variable problems, after the problem has been converted to discrete polynomial form. Logic relations embedded in 0-1 variables are explored by a simple consensus operation to serve as the main minimization strategy. The procedure for sequential generation of prime implicants avoids rapidly increasing the number of prime implicants when problems become large. The computational results indicate that this algorithm is quite reliable for 0-1 problem formulations.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Prime implicates"

1

Tirumalai, Parthasarathy P., and Jon T. Butler. Prime and Non-Prime Implicants in the Minimization of Multiple-Valued Logic Functions. Fort Belvoir, VA: Defense Technical Information Center, January 1989. http://dx.doi.org/10.21236/ada605375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Prime implicates' 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