Relevant bibliographies by topics / Propositional resolution

Academic literature on the topic 'Propositional resolution'

Author: Grafiati
Published: 4 June 2021
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Propositional resolution.'

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 "Propositional resolution"

1

PLAZA, JAN A. "ON THE PROPOSITIONAL SLDNF-RESOLUTION." International Journal of Foundations of Computer Science 07, no. 04 (December 1996): 359–406. http://dx.doi.org/10.1142/s0129054196000269.

Full text
Abstract:
We consider propositional logic programs with negations. We define notions of constructive transformation and constructive completion of a program. We use these notions to characterize SLDNF-resolution in classical, intuitionistic and intermediate logics, and also to derive a characterization in modal logics of knowledge. We show that the three-valued and four-valued fix-point or declarative semantics for program P are equivalent to the two-valued semantics for the constructive version of P. We argue that it would be beneficial to replace Negation as Failure by constructive transformation, and it would be beneficial to use the semantics for the constructive version of the program instead of multivalued semantics for the original program.
APA, Harvard, Vancouver, ISO, and other styles
2

UZQUIANO, GABRIEL. "A NEGLECTED RESOLUTION OF RUSSELL’S PARADOX OF PROPOSITIONS." Review of Symbolic Logic 8, no. 2 (March 31, 2015): 328–44. http://dx.doi.org/10.1017/s1755020315000106.

Full text
Abstract:
AbstractBertrand Russell offered an influential paradox of propositions in Appendix B of The Principles of Mathematics, but there is little agreement as to what to conclude from it. We suggest that Russell’s paradox is best regarded as a limitative result on propositional granularity. Some propositions are, on pain of contradiction, unable to discriminate between classes with different members: whatever they predicate of one, they predicate of the other. When accepted, this remarkable fact should cast some doubt upon some of the uses to which modern descendants of Russell’s paradox of propositions have been put in recent literature.
APA, Harvard, Vancouver, ISO, and other styles
3

Auffray, Yves. "Linear strategy for propositional modal resolution." Information Processing Letters 28, no. 2 (June 1988): 87–92. http://dx.doi.org/10.1016/0020-0190(88)90169-x.

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

MAREK, V. W., and J. B. REMMEL. "Guarded resolution for Answer Set Programming." Theory and Practice of Logic Programming 11, no. 1 (March 24, 2010): 111–23. http://dx.doi.org/10.1017/s1471068410000062.

Full text
Abstract:
AbstractWe investigate a proof system based on a guarded resolution rule and show its adequacy for the stable semantics of normal logic programs. As a consequence, we show that Gelfond–Lifschitz operator can be viewed as a proof-theoretic concept. As an application, we find a propositional theory EP whose models are precisely stable models of programs. We also find a class of propositional theories 𝓒P with the following properties. Propositional models of theories in 𝓒P are precisely stable models of P, and the theories in 𝓒T are of the size linear in the size of P.
APA, Harvard, Vancouver, ISO, and other styles
5

Van Gelder, Allen. "Complexity analysis of propositional resolution with autarky pruning." Discrete Applied Mathematics 96-97 (October 1999): 195–221. http://dx.doi.org/10.1016/s0166-218x(99)00040-2.

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

Stachniak, Zbigniew. "Minimization of Resolution Proof Systems." Fundamenta Informaticae 14, no. 1 (January 1, 1991): 129–46. http://dx.doi.org/10.3233/fi-1991-14107.

Full text
Abstract:
In this paper we show that minimal resolution counterparts of strongly finite logics can be effectively constructed. Moreover, we show that the class of resolution counterparts of structural propositional logics coincides with the class of resolution counterparts of strongly finite logics.
APA, Harvard, Vancouver, ISO, and other styles
7

Walicki, Michal, and Sjur Dyrkolbotn. "Paraconsistent resolution." Australasian Journal of Logic 19, no. 3 (September 6, 2022): 96–123. http://dx.doi.org/10.26686/ajl.v19i3.6471.

Full text
Abstract:
Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for inconsistent theories, specializing to the classical semantics for the consistent ones. Direct (instead of refutational) reasoning with classical resolution is sound and complete for this semantics, when augmented with a specific weakening which, in particular, excludes Ex Falso. Dropping all forms of weakening yields reasoning which also avoids typical fallacies of relevance.
APA, Harvard, Vancouver, ISO, and other styles
8

LIMA, PRISCILA M. V. "A GOAL-DRIVEN NEURAL PROPOSITIONAL INTERPRETER." International Journal of Neural Systems 11, no. 03 (June 2001): 311–22. http://dx.doi.org/10.1142/s012906570100076x.

Full text
Abstract:
This work presents ARQ-PROP-II, the propositional version of a neural engine for finding proofs by refutation using the Resolution Principle. This neural architecture does not require special arrangements or modules to do forward or backward reasoning, being driven by the goal posed to it. ARQ-PROP-II is capable of integrated monotonic reasoning with complete and incomplete knowledge. The neural mechanism presented herein is the first to our knowledge that does not require that the knowledge base be either pre-encoded or learnt.
APA, Harvard, Vancouver, ISO, and other styles
9

Buss, Samuel R. "Polynomial size proofs of the propositional pigeonhole principle." Journal of Symbolic Logic 52, no. 4 (December 1987): 916–27. http://dx.doi.org/10.2307/2273826.

Full text
Abstract:
AbstractCook and Reckhow defined a propositional formulation of the pigeonhole principle. This paper shows that there are Frege proofs of this propositional pigeonhole principle of polynomial size. This together with a result of Haken gives another proof of Urquhart's theorem that Frege systems have an exponential speedup over resolution. We also discuss connections to provability in theories of bounded arithmetic.
APA, Harvard, Vancouver, ISO, and other styles
10

Zou, Li, XiaoNan Li, Chang Pan, and Xin Liu. "( α, β )-Ordered linear resolution of intuitionistic fuzzy propositional logic." Information Sciences 414 (November 2017): 329–39. http://dx.doi.org/10.1016/j.ins.2017.05.046.

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

Dissertations / Theses on the topic "Propositional resolution"

1

Boskovitz, Agnes, and abvi@webone com au. "Data Editing and Logic: The covering set method from the perspective of logic." The Australian National University. Research School of Information Sciences and Engineering, 2008. http://thesis.anu.edu.au./public/adt-ANU20080314.163155.

Full text
Abstract:
Errors in collections of data can cause significant problems when those data are used. Therefore the owners of data find themselves spending much time on data cleaning. This thesis is a theoretical work about one part of the broad subject of data cleaning - to be called the covering set method. More specifically, the covering set method deals with data records that have been assessed by the use of edits, which are rules that the data records are supposed to obey. The problem solved by the covering set method is the error localisation problem, which is the problem of determining the erroneous fields within data records that fail the edits. In this thesis I analyse the covering set method from the perspective of propositional logic. I demonstrate that the covering set method has strong parallels with well-known parts of propositional logic. The first aspect of the covering set method that I analyse is the edit generation function, which is the main function used in the covering set method. I demonstrate that the edit generation function can be formalised as a logical deduction function in propositional logic. I also demonstrate that the best-known edit generation function, written here as FH (standing for Fellegi-Holt), is essentially the same as propositional resolution deduction. Since there are many automated implementations of propositional resolution, the equivalence of FH with propositional resolution gives some hope that the covering set method might be implementable with automated logic tools. However, before any implementation, the other main aspect of the covering set method must also be formalised in terms of logic. This other aspect, to be called covering set correctibility, is the property that must be obeyed by the edit generation function if the covering set method is to successfully solve the error localisation problem. In this thesis I demonstrate that covering set correctibility is a strengthening of the well-known logical properties of soundness and refutation completeness. What is more, the proofs of the covering set correctibility of FH and of the soundness / completeness of resolution deduction have strong parallels: while the proof of soundness / completeness depends on the reduction property for counter-examples, the proof of covering set correctibility depends on the related lifting property. In this thesis I also use the lifting property to prove the covering set correctibility of the function defined by the Field Code Forest Algorithm. In so doing, I prove that the Field Code Forest Algorithm, whose correctness has been questioned, is indeed correct. The results about edit generation functions and covering set correctibility apply to both categorical edits (edits about discrete data) and arithmetic edits (edits expressible as linear inequalities). Thus this thesis gives the beginnings of a theoretical logical framework for error localisation, which might give new insights to the problem. In addition, the new insights will help develop new tools using automated logic tools. What is more, the strong parallels between the covering set method and aspects of logic are of aesthetic appeal.
APA, Harvard, Vancouver, ISO, and other styles
2

Brocolini, Laurent. "Caractérisation de l'environnement sonore urbain : Proposition de nouveaux indicateurs de qualité." Phd thesis, Université de Cergy Pontoise, 2012. http://tel.archives-ouvertes.fr/tel-00855265.

Full text
Abstract:
A l'heure actuelle, les seuls moyens d'informer les usagers de la ville de l'environnement sonore dans lequel ils vivent consistent en des indicateurs de niveaux sonores moyens et annuels obtenus par modélisation acoustique des principales infrastructures de transports. Or, ces indicateurs sont difficilement compris et de ce fait mal interprétés par les usagers de la ville car ils ne reflètent pas la signification des bruits perçus et la diversité des situations que les citadins rencontrent. Le but de ce travail de recherche est donc d'analyser la façon dont les usagers de la ville perçoivent le paysage sonore urbain afin de définir des indicateurs de qualité sonore qui pourront être à terme intégrés dans une représentation territoriale cartographique. Pour ce faire, il a tout d'abord été nécessaire de s'attacher à déterminer un pas temporel et spatial de mesure permettant de caractériser des ambiances urbaines d'un point de vue acoustique. A partir d'enregistrements longue durée (trois mois environs) en six points fixes à Paris, il a été possible de déterminer à travers des classifications ascendantes hiérarchiques de Ward associées à des cartes auto-organisatrices de Kohonen qu'une durée de dix minutes semble dans la plupart des cas être suffisante pour caractériser différentes ambiances sonores. Grâce aux mêmes méthodes de classification, l'analyse du maillage spatial a permis de définir quatre zones homogènes qui correspondent (1) au parc, (2) au boulevard, (3) à la rue piétonne puis (4) une zone que l'on qualifiera de zone de transition. La suite de l'étude s'est attachée à construire des modèles de prédiction de la qualité sonore. A partir d'enquêtes de terrain réalisées à Paris et à Lyon, il a été possible d'établir des modèles à la fois locaux (caractérisant le lieu même où le questionnaire a été évalué) et globaux basés d'une part sur des régressions linéaires multiples et d'autre part sur des réseaux de neurones artificiels. La comparaison de ces deux types de modèles a permis entre autre de mettre en évidence l'apport des réseaux de neurones artificiels devant les régressions linéaires multiples en termes de prédiction. Par ailleurs il est ressorti de ces modèles l'importance de variables telles que le silence, l'agrément visuel ou encore la présence de sources sonores particulières comme les véhicules légers pour expliquer la qualité sonore de l'environnement.
APA, Harvard, Vancouver, ISO, and other styles
3

Antibi, André. "Etude sur l'enseignement de methodes de demonstration, enseignement de la notion de limite : reflexions, propositions." Toulouse 3, 1988. http://www.theses.fr/1988TOU30139.

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

Barthe, Benjamin. "La clause de sortie des relations contractuelles : proposition de définition unitaire." Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM1006.

Full text
Abstract:
La théorie générale des obligations contractuelles ne traite de la rupture du contrat qu’au travers de la résolution. Elle n’évoque pas non plus la notion de durée du contrat. L’attention des juristes français est ainsi essentiellement portée sur la résolution pour inexécution et sur la résiliation unilatérale fautive du contrat à durée indéterminée. Une autre présentation, plus neutre, est possible : il s’agit d’étudier la sortie du contrat et, plus particulièrement, la possibilité offerte aux parties de prévoir la sortie anticipée de leurs relations contractuelles.Il est alors possible de se rendre compte que la pratique, face aux lacunes de la théorie générale, a su adapter l’existant afin de prendre en compte l’évolution du contrat depuis le début du XIXème siècle. De nombreuses clauses, qui permettent à un contractant de sortir de manière anticipée du contrat, se sont ainsi développées sous des appellations diverses et sont aujourd’hui présentes dans tous les contrats. L’analyse de la jurisprudence fait apparaître que le contentieux qui en résulte, non seulement porte sur des problèmes communs, mais tend à apporter des solutions communes ; à tout le moins perçoit-on la nécessité d’un traitement unitaire. L’étude, repoussant la distinction classique entre la résolution et la résiliation, recherche l’existence d’une unité, cherche à vérifier l’existence de la clause de sortie qui instituerait une faculté de sortir de manière anticipée d’une relation conclue pour une durée déterminée. Pour cela, la clause de sortie est appréhendée comme toute autre clause « autonome ».Dans un premier temps, il faut démontrer l’existence d’un objectif commun de validité. Il est question tout d’abord de faire ressortir la fonction commune des clauses, qui est de prémunir le titulaire de la faculté de sortie contre une atteinte à son intérêt. L’unité se poursuit dans la nature de la clause : issue d’un accord des parties, elle met en place un droit potestatif. Elle prend alors les traits d’une condition résolutoire « moderne », adaptation contemporaine de la modalité de l’obligation prévue par le Code civil.Dans un second temps, une fois qu’elles sont valablement prévues, les clauses de sortie doivent encore répondre à un objectif commun d’efficacité : la sortie s’exerce par acte unilatéral et obéit alors aux règles applicables à ce dernier. Au-delà de ce régime, on peut se rendre compte qu’il existe des modalités communes à toutes les clauses de sortie. Les effets des clauses de sortie, enfin, présentent ou doivent présenter une certaine unité, que la sortie mise en œuvre soit réussie ou qu’elle soit « manquée »
The general theory of the contractual obligations treats breach of contract only through the “résolution”. It does not mention either the concept of duration of the contract. The attention of the French jurists is mainly focused on the cancellation for non-fulfilment and the offending termination of the agreement without any term. Another presentation, more neutral, is however possible, studying the exit of the contract and, more particularly, the opportunity given to the contracting parties to envisage the exit of their contractual relations.Then it is possible to realize that the practice, against the gaps of the general theory, knew to adapt existing concepts in order to take into consideration the evolution of the contract since the beginning of the 19th century. Thus many clauses, which make it possible to one of the contracting parties to leave the contract, developed under various names and are today present in all the contracts. The analysis of jurisprudence reveals that the litigations which result from it, not only relate to common problems, but also tend to bring common solutions ; at the very least, one perceives the need for a unit treatment. The study, pushing back the classical distinction between the “résolution” and the “résiliation”, seeks the existence of a unit, seeks to check the existence of the exit clause which would institute a faculty to leave in a way anticipated of a relation concluded for one limited duration. For that purpose, the exit clause is approached like any other “autonomous” clause.Initially, it is necessary to show the existence of a common objective of validity. It is question first of all of emphasizing the common function of the clauses, which is to secure the holder of the faculty of exit against a loss of interest. The unit continues in the nature of the clause: resulting from an agreement of the parties, it sets up a “potestative” right. It then takes the features of a “modern” “resolutive condition”, contemporary adaptation of the condition of the obligation envisaged by the Civil code.In the second time, once they are validly provided, the clauses of exit must meet a common aim of effectiveness : the exit is exerted by unilateral act and then obeys the rules applicable in this case. Beyond this mode, one can realize that there exist common conditions to all the clauses of exit. The effects of these clauses, finally, present or must present a certain unit, whether the exit put in work is successful or that it failed
APA, Harvard, Vancouver, ISO, and other styles
5

Ben, Jaffel Lotfi. "Methodes numeriques pour la resolution de l'equation de transfert radiatif : application a l'etude de l'emission lyman-alpha de jupiter et d'uranus en geometrie plan parallele : proposition de la methode spectrale pour la resolution de l'equation." Paris 6, 1989. http://www.theses.fr/1989PA066043.

Full text
Abstract:
La methode d'addition de couches, la methode exponentielle et enfin la methode spectrale sont proposees pour la resolution de l'equation de transfert de rayonnement. Les milieux inhomogenes peuvent etre traites par une juxtaposition de couches radialement homogenes pour lesquelles les trois methodes s'appliquent automatiquement et sans grande difficulte. Une telle simulation est d'autant meilleure que les parametres du milieu varient continument et que le nombre de couches homogenes considerees est grand. Dans le cadre d'une geometrie plan parallele, nous avons d'abord applique la methode d'addition de couches a l'etude de l'emission lyman-alpha de jupiter. Nous avons ainsi demontre qu'il est possible de deduire certaines quantites physiques concernant le milieu, comme par exemple la densite de colonne totale de l'hydrogene. De meme, nous avons utilise la methode exponentielle a la reconstitution du balayage bord a bord de la planete uranus a lyman-alpha; nous avons pu montrer l'importance de la contribution des ailes de cette raie a l'emission totale de la planete. Nous proposons enfin la methode spectrale pour la resolution de l'equation de transfert a plusieurs dimensions. Pour cela, nous developpons le champ de rayonnement en une serie particulierement de fourier sur les parametres angulaires decrivant le milieu. Cette decomposition permet de ramener le probleme a un systeme d'equations a une dimension qu'on resout aussi bien par la methode d'addition de couches que par la methode exponentielle
APA, Harvard, Vancouver, ISO, and other styles
6

Razafiarison, Tahiry Anja. "La responsabilité médicale à Madagascar : Réalités internes et proposition d'actualisation en référence au droit médical français." Thesis, Poitiers, 2013. http://www.theses.fr/2013POIT3003/document.

Full text
Abstract:
Afin de répondre aux attentes de la société malgache, une proposition de loi relative à la responsabilité médicale doit être en cohérence avec la vision locale de la pratique médicale. À Madagascar, l'issue d'un acte de soin est supposée émaner de la divinité et ne saurait être maîtrisé par le soignant. De fait, l'aléa thérapeutique s'insère dans le droit médical local. Le médecin n'est pas tenu de réaliser une guérison; il doit prodiguer des soins consciencieux et conformes à la science. Ceci étant, la culture malgache est sensible à toute atteinte corporelle subie par la victime d'accident médical. Le cas échéant, le médecin fait un "geste" de courtoisie à l'égard de la victime. Ce "geste" peut ne pas représenter l'intégralité du préjudice mais il participe au respect de la victime. Ainsi, à Madagascar, l'obligation médicale de réparer vise la reconnaissance de la douleur du patient et non la réparation quantitative du préjudice. Sur ce point, une divergence se dessine avec le droit français lequel préconise la réparation intégrale pour les atteintes corporelles. Les modes alternatifs de résolution des conflits présents dans les deux systèmes juridiques, dénouent cette divergence
To come up to the Malagasy society's expectations a legal act on medical responsibility should be coherent with the local conception of medical practice. In Madagascar, the public opinion is convinced that medical practice has to deal with a divine action out of the physician's control so that the legal concept of therapeutic risk is therefore accepted. The physician is only required to assume the continuity of the service and to provide his or her best care to patients. Meanwhile Malagasy culture shows an extreme compassion towards people suffering of bodily injuries mainly when these wounds result from a malpractice. To prevent a godly punishment doctors usually have to donate to their injured patient. This helps to preserve the physician's reputation and his or her relationship with the patient. Medical duty in Madagascar is more a matter of recognition of the patient's pain than a procedure of compensation. French legal system is different as it promotes the complete compensation in case of malpractice. However, both legal systems are similar when proposing alternative process to resolve conflicts
APA, Harvard, Vancouver, ISO, and other styles
7

Zulaica, Hernandez Iker. "Demonstrative pronouns in Spanish: a discourse-based approach." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1196826616.

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

Hertel, Alexander. "Applications of Games to Propositional Proof Complexity." Thesis, 2008. http://hdl.handle.net/1807/16735.

Full text
Abstract:
In this thesis we explore a number of ways in which combinatorial games can be used to help prove results in the area of propositional proof complexity. The results in this thesis can be divided into two sets, the first being dedicated to the study of Resolution space (memory) requirements, whereas the second is centered on formalizing the notion of `dangerous' reductions. The first group of results investigate Resolution space measures by asking questions of the form, `Given a formula F and integer k, does F have a [Type of Resolution] proof with [Type of Resource] at most k?'. We refer to this as a proof complexity resource problem, and provide comprehensive results for several forms of Resolution as well as various resources. These results include the PSPACE-Completeness of Tree Resolution clause space (and the Prover/Delayer game), the PSPACE-Completeness of Input Resolution derivation total space, and the PSPACE-Hardness of Resolution variable space. This research has theoretical as well as practical motivations: Proof complexity research has focused on the size of proofs, and Resolution space requirements are an interesting new theoretical area of study. In more practical terms, the Resolution proof system forms the underpinnings of all modern SAT-solving algorithms, including clause learning. In practice, the limiting factor on these algorithms is memory space, so there is a strong motivation for better understanding it as a resource. With the second group of results in this thesis we investigate and formalize what it means for a reduction to be `dangerous'. The area of SAT-solving necessarily employs reductions in order to translate from other domains to SAT, where the power of highly-optimized algorithms can be brought to bear. Researchers have empirically observed that it is unfortunately possible for reductions to map easy instances from the input domain to hard SAT instances. We develop a non-Hamiltonicity proof system and combine it with additional results concerning the Prover/Delayer game from the first part of this thesis as well as proof complexity results for intuitionistic logic in order to provide the first formal examples of harmful and beneficial reductions, ultimately leading to the development of a framework for studying and comparing translations from one language to another.
APA, Harvard, Vancouver, ISO, and other styles
9

Zabawa, Daniel Michael. "Expansion, Random Graphs and the Automatizability of Resolution." Thesis, 2008. http://hdl.handle.net/1807/10444.

Full text
Abstract:
We explore the relationships between the computational problem of recognizing expander graphs, and the problem of efficiently approximating proof length in the well-known system of \emph{resolution}. This program builds upon known connections between graph expansion and resolution lower bounds. A proof system $P$ is \emph{(quasi-)automatizable} if there is a search algorithm which finds a $P$-proof of a given formula $f$ in time (quasi)polynomial in the length of a shortest $P$-proof of $f$. It is open whether resolution is (quasi-)automatizable. We prove several conditional non-automatizability results for resolution modulo new conjectures concerning the complexity of identifying bipartite expander graphs. Our reductions use a natural family of formulas and exploit the well-known relationships between expansion and length of resolution proofs. Our hardness assumptions are unsupported; we survey known results as progress towards establishing their plausibility. The major contribution is a conditional hardness result for the quasi-automatizability of resolution.
APA, Harvard, Vancouver, ISO, and other styles
10

Van, der Vyver Thelma. "Proof systems for propositional modal logic." Diss., 1997. http://hdl.handle.net/10500/16280.

Full text
Abstract:
In classical propositional logic (CPL) logical reasoning is formalised as logical entailment and can be computed by means of tableau and resolution proof procedures. Unfortunately CPL is not expressive enough and using first order logic (FOL) does not solve the problem either since proof procedures for these logics are not decidable. Modal propositional logics (MPL) on the other hand are both decidable and more expressive than CPL. It therefore seems reasonable to apply tableau and resolution proof systems to MPL in order to compute logical entailment in MPL. Although some of the principles in CPL are present in MPL, there are complexities in MPL that are not present in CPL. Tableau and resolution proof systems which address these issues and others will be surveyed here. In particular the work of Abadi & Manna (1986), Chan (1987), del Cerro & Herzig (1988), Fitting (1983, 1990) and Gore (1995) will be reviewed.
Computing
M. Sc. (Computer Science)
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Propositional resolution"

1

Höglund, Kristine. Violence-- catalyst or obstacle to conflict resolution?: Seven propositions concerning the effect of violence on peace negotiations. Uppsala: Dept. of Peace and Conflict Research, Uppsala University, 2001.

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

Jonathan, Swift, and Leon WAILLY (DE). PROPOSITIONS, RESOLUTIONS. CIRCE, 1998.

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

Hirschberg, Julia. Pragmatics and Prosody. Edited by Yan Huang. Oxford University Press, 2015. http://dx.doi.org/10.1093/oxfordhb/9780199697960.013.28.

Full text
Abstract:
Variation in prosody can influence the interpretation of linguistic phenomena in many languages. Type and location of prosodic prominence and prosodic phrase boundaries, differences in overall fundamental frequency (f0) contours, and changes in intensity, duration, and speaking rate can serve to inform hearers about syntactic attachment, disambiguate scope of modifiers and negation, signal information status, indicate type of speech act or propositional attitude, and contribute to the licensing of implicatures and to reference resolution. This chapter discusses aspects of prosodic variation and pragmatic meaning which have been explored in linguistics, computational linguistics, and psycholinguistics. It begins by describing some commonly used frameworks for representing prosody, including the ToBI framework, which is used to identify prosodic variation throughout. The pragmatic influence of prosody on the interpretation of syntactic, semantic, and discourse phenomena is then examined. It concludes by suggesting new avenues for research in the relationship between prosody and pragmatic interpretation.
APA, Harvard, Vancouver, ISO, and other styles
4

Peter J, Rees. Part II Understanding the Users of International Arbitration, 4 Putting the Client First. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198783206.003.0005.

Full text
Abstract:
This chapter considers the question of whether arbitration remains client-focused. It looks at two aspects of modern arbitration practice which may not be as client focused as they could, and should, be. The first is the need to reduce the time and cost of arbitration; the second is the fear of arbitral tribunals that their awards will be open to challenge. The discussion starts from the very basic and very obvious proposition that clients’ interests are most likely to be aligned before there is a dispute. Once a dispute has arisen, even the most reasonable of clients can become unreasonable. Thus, if anything is going to be done to address the expensive and time-consuming aspects of the dispute resolution process, it needs to be done before the dispute starts. It needs to be in the rules which will apply to the arbitration.
APA, Harvard, Vancouver, ISO, and other styles
5

Mokal, Riz, Ronald Davis, Alberto Mazzoni, Irit Mevorach, Madam Justice Barbara Romaine, Janis Sarra, Ignacio Tirado, and Stephan Madaus. Micro, Small, and Medium Enterprise Insolvency. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198799931.001.0001.

Full text
Abstract:
This volume examines the current resolution process for distressed micro, small, and medium enterprises (MSMEs), and proposes a different, more appropriate, ‘modular’ approach to the treatment of such entities when faced with insolvency proceedings. MSMEs play a vital role in virtually all global economies. They are a primary means of employment and the vehicle by which entrepreneurs bring new business propositions to the market and deliver a range of products and services to local economies. MSMEs tend to be more reliant than larger businesses on favourable legal and regulatory climates in order to survive and thrive. Yet in assuming an extensive insolvency estate of significant worth, the presence of creditors and other concerned stakeholders to participate in and oversee the process, and the extensive involvement of courts and insolvency and legal professionals, insolvency regimes are often more tailored to the circumstances of larger businesses. These assumptions and features generally sit incongruously with the reality of MSMEs, whose estates characteristically have modest value and many of whose stakeholders tend to be disinterested in the MSME’s insolvency process. The Modular Approach developed in this text addresses the imbalances, inconsistencies, and lack of supervision which are often apparent in the treatment of insolvent MSMEs. The volume provides an overview of existing approaches to MSME insolvency, the place of MSMEs in the global economy, and the particular needs of MSMEs in financial distress. It then sets out the procedural framework, policy objectives, and key components of the Modular Approach, detailing how a choice of modules enables national policymakers a more flexible process for resolution. The volume outlines the roles, positions, and obligations of key stakeholder groups, and explains the managerial, administrative, and judicial functions of this approach. Finally, it explains how elements of the broader legal system should be aligned with, and supportive of, the optimal functioning of the Modular Approach.
APA, Harvard, Vancouver, ISO, and other styles
6

Dye, Christopher. The Great Health Dilemma. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198853824.001.0001.

Full text
Abstract:
The proverbial benefits of prevention over cure are self-evident—and yet we are reluctant to invest in staying healthy. Resolution of this age-old dilemma begins with a timeless truth: the benefits of good health come at a cost: prevention is not better than cure at any price. That logic leads to a testable—and refutable—proposition: that prevention should be favoured when an imminent, high-risk, high-impact hazard can be averted at relatively low cost. Application of this idea helps to explain why cigarette smoking is still commonplace, why the world was not ready for the COVID-19 pandemic, why the idea of a ‘sin tax’ is misconceived, why billions still do not have access to safe sanitation, why the response to climate change has been so slow, and why public health advice often falls on deaf ears. Much more money and effort are invested in health promotion and prevention today than is commonly thought, but the enormous avoidable burden of illness is reason to seek incentives for investing still more. The principles, together with a series of case studies in diverse settings, offer 12 lessons for prevention. These are methods and motives for shifting the balance away from reactive medical treatment, bypassing illness and injury, to promote better health and well-being.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Propositional resolution"

1

Genesereth, Michael, and Eric J. Kao. "Propositional Resolution." In Introduction to Logic, 53–61. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-031-01801-5_5.

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

Genesereth, Michael, and Eric Kao. "Propositional Resolution." In Introduction to Logic, 33–40. Cham: Springer International Publishing, 2012. http://dx.doi.org/10.1007/978-3-031-01798-8_4.

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

Genesereth, Michael, and Eric Kao. "Propositional Resolution." In Introduction to Logic, 49–57. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-031-01799-5_5.

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

Ben-Ari, Mordechai. "Propositional Logic: Resolution." In Mathematical Logic for Computer Science, 75–93. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4129-7_4.

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

Stachniak, Zbigniew. "Propositional Resolution Logics." In Automated Reasoning Series, 47–71. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-1677-7_3.

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

Bonacina, Ilario. "Resolution." In Space in Weak Propositional Proof Systems, 15–28. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73453-8_2.

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

Stachniak, Zbigniew. "Propositional Resolution Proof Systems." In Automated Reasoning Series, 23–46. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-1677-7_2.

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

Bonacina, Ilario. "Space in Resolution." In Space in Weak Propositional Proof Systems, 29–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73453-8_3.

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

Ben-Ari, Mordechai. "Propositional Calculus: Resolution and BDDs." In Mathematical Logic for Computer Science, 67–100. London: Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0335-6_4.

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

Kerber, Manfred. "Heuristics for Resolution in Propositional Logic." In KI 2009: Advances in Artificial Intelligence, 656–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04617-9_82.

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

Conference papers on the topic "Propositional resolution"

1

HAN, BANGHE, and XIAONAN LI. "SEMANTIC RESOLUTION PRINCIPLE IN PROPOSITIONAL VALUATION ALGEBRA." In Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0008.

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

Wan Li and Yang Xu. "An elimination resolution based on propositional logic." In 2016 International Conference on Fuzzy Theory and Its Applications (iFuzzy). IEEE, 2016. http://dx.doi.org/10.1109/ifuzzy.2016.8004925.

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

LI, WENJIANG, and YANG XU. "A RESOLUTION METHOD ON LATTICE-VALUED TENSE PROPOSITIONAL LOGIC." In Proceedings of the 6th International FLINS Conference. WORLD SCIENTIFIC, 2004. http://dx.doi.org/10.1142/9789812702661_0019.

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

Li, Baihua, Xiaonan Li, Chang Pan, Li Zou, and Yang Xu. "(alpha, beta)-Ordered Linear Resolution of Intuitionistic Fuzzy Propositional Logic." In 2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE). IEEE, 2015. http://dx.doi.org/10.1109/iske.2015.101.

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

Li Zou, Fang Sun, and Yang Xu. "Resolution method of six-element linguistic truth-valued intuitionistic propositional logic." In 2008 3rd International Conference on Intelligent System and Knowledge Engineering (ISKE 2008). IEEE, 2008. http://dx.doi.org/10.1109/iske.2008.4730914.

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

XU, WEITAO, YANG XU, WENHONG DENG, XIAOMEI ZHONG, and XINGXING HE. "IDEAL-BASED RESOLUTION PRINCIPLE FOR LATTICE-VALUED PROPOSITIONAL LOGIC LP(X)." In Proceedings of the 4th International ISKE Conference on Intelligent Systems and Knowledge Engineering. WORLD SCIENTIFIC, 2009. http://dx.doi.org/10.1142/9789814295062_0093.

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

Hairui Jia, Yang Xu, Yi Liu, and Huicong He. "1-minimal resolution principle based on lattice-valued propositional logic LP(X)." In 2013 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2013. http://dx.doi.org/10.1109/icmlc.2013.6890877.

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

Zhong, Xiaomei, and Yang Xu. "α-group resolution method based on lattice-valued propositional logic LP(X)." In 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). IEEE, 2011. http://dx.doi.org/10.1109/fskd.2011.6019839.

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

JIA, HAIRUI, LIMIN DU, and YANG XU. "NON-CLAUSAL α-MINIMAL GENERALIZED RESOLUTION PRINCIPLE FOR LATTICE-VALUED PROPOSITIONAL LOGIC." In Conference on Uncertainty Modelling in Knowledge Engineering and Decision Making (FLINS 2016). WORLD SCIENTIFIC, 2016. http://dx.doi.org/10.1142/9789813146976_0075.

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

XU, YANG, WEITAO XU, XIAOMEI ZHONG, and XINGXING HE. "α–GENERALIZED RESOLUTION PRINCIPLE BASED ON LATTICE-VALUED PROPOSITIONAL LOGIC LP(X)." In Proceedings of the 9th International FLINS Conference. WORLD SCIENTIFIC, 2010. http://dx.doi.org/10.1142/9789814324700_0008.

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