249,695 Hits in 3.5 sec

Improved Propositional Extension Rule [chapter]

Xia Wu, Jigui Sun, Shuai Lu, Ying Li, Wei Meng, Minghao Yin
2006 Lecture Notes in Computer Science  
, which combines the extension rule and resolution.  ...  In order to increase its efficiency, this paper improves it by some reduction rules. And then the soundness and completeness of the improved algorithm is proved.  ...  Propositional Extension Rule and Its Improvement We run back over the central idea of the extension rule based TP at first. The details can be found in [4] .  ... 
doi:10.1007/11795131_86 fatcat:lxypxnenonf3fpv2k7qckp7pni

Page 276 of The Monist Vol. 39, Issue 2 [page]

1929 The Monist  
On the basis of this view of the nature of propositions, it is possible to quantify the pred- icate as well as the subject. With this done, classes can be taken in extension—which is what Boole did.  ...  Boole and those who aided in the formation of symbolic logic were not consciously attempting to improve logic.  ... 

Admissibility of Ackermann's rule δ in relevant logics

Gemma Robles
2013 Logic and Logical Philosophy  
It is proved that Ackermann's rule δ is admissible in a wide spectrum of relevant logics satisfying certain syntactical properties.  ...  Proposition 4 . 4 Let EB a+ be any extension of B a+ formulated as in Proposition 3. Then the rule (dm) is not derivable in EB a+ .  ...  The results in the present paper much improve those in [7] in two respects: 1.  ... 
doi:10.12775/llp.2013.018 fatcat:rd6goydwgvdx3js7tqcoirfnsq

An Abductive Framework for General Logic Programs and other Nonmonotonic Systems

Gerhard Brewka, Kurt Konolige
1993 International Joint Conference on Artificial Intelligence  
We present an abductive semantics for general propositional logic programs which defines the meaning of a logic program in terms of its extensions.  ...  Proposition 3 If F and F f are two extensions, then F U F' is inconsistent.  ...  The key feature of abductive extensions is that a proposition may be neither believed (Lp) nor disbelieved (-Lp) in the extension.  ... 
dblp:conf/ijcai/BrewkaK93 fatcat:fcopzlqqvnendgcor4l5lph7xm

Minimal monotonic extensions of scoring rules

Orhan Erdem, M. Remzi Sanver
2005 Social Choice and Welfare  
1 We show that there exists no scoring rule, which is Maskin monotonic and characterize minimal monotonic extensions of scoring rules.  ...  In addition to a general characterization result, we also give relatively simpler computations for some well-known scoring rules, such as the Plurality rule and Borda rule.  ...  Our first result, stated in the following proposition, is that the minimal monotonic extension of every scoring rule is bounded above by the alternatives receiving the critical score σ c .  ... 
doi:10.1007/s00355-005-0058-y fatcat:5jcusdpy4nhs7jf55xd2jhgz4a

On Expansion and Resolution in CEGAR Based QBF Solving [article]

Leander Tentrup
2018 arXiv   pre-print
A quantified Boolean formula (QBF) is a propositional formula extended with universal and existential quantification over propositions.  ...  Lastly, we implement the new calculus and confirm experimentally that the theoretical improvements lead to improved performance.  ...  Q-resolution [19] is an extension of the (propositional) resolution rule to handle universal quantification.  ... 
arXiv:1803.09559v1 fatcat:rja7icixlvdcth7gqik7trlce4

On Expansion and Resolution in CEGAR Based QBF Solving [chapter]

Leander Tentrup
2017 Lecture Notes in Computer Science  
A quantified Boolean formula (QBF) is a propositional formula extended with universal and existential quantification over propositions.  ...  Lastly, we implement the new calculus and confirm experimentally that the theoretical improvements lead to improved performance.  ...  Q-resolution [19] is an extension of the (propositional) resolution rule to handle universal quantification.  ... 
doi:10.1007/978-3-319-63390-9_25 fatcat:nuabyzxfp5dltpgsltvocztwmu

On Sandewall's paper: Nonmonotonic inference rules for multiple inheritance with exceptions

Geneviève Simonet
1996 Artificial Intelligence  
Flaws in Sandewall's set of rules are shown and a revised set of rules is proposed.  ...  Moreover, although most approaches to inheritance leave it in the metalanguage, it is shown that putting preclusion in the object language provides extensions with desirable general properties which are  ...  Hc has greatly contributed to the improvement of the paper by his numerous and detailed comments and corrections.  ... 
doi:10.1016/s0004-3702(96)00029-x fatcat:5vyabw77yre7xoa53obb4wjnwe

Integrating a hypernymic proposition interpreter into a semantic processor for biomedical texts

Marcelo Fiszman, Thomas C Rindflesch, Halil Kilicoglu
2003 AMIA Annual Symposium Proceedings  
to improve overall accuracy.  ...  A preliminary evaluation assesses the contribution of hypernymic propositions in providing more specific semantic predications and thus improving effectiveness in retrieving treatment propositions in MEDLINE  ...  Currently, we constrain this integration to treatment propositions in MEDLINE citations, but we discuss the extension of this methodology to additional semantic propositions as well as other types of biomedical  ... 
pmid:14728170 pmcid:PMC1479962 fatcat:ymlyrclqrnd4pflhkqi7g63caq

A Semantic Completeness Proof for TaMeD [chapter]

Richard Bonichon, Olivier Hermant
2006 Lecture Notes in Computer Science  
If P is defined at step n by the second extension rule: it is immediate.  ...  It is an improvement over both [2, 9] and [19] .  ... 
doi:10.1007/11916277_12 fatcat:msi6arkv5rdghmrjq4abs4p74u

A Static Preprocess for Improving Fuzzy Thresholded Tabulation [chapter]

P. Julián, J. Medina, P. J. Morcillo, G. Moreno, M. Ojeda-Aciego
2011 Lecture Notes in Computer Science  
Conclusions and Future Work In this paper, we were concerned with same static improvements that can be easily achieved on the thresholded tabulation procedure we have recently designed in [6] for the  ...  platform [12] , for the near future we plan to formally define the unfolding process of the method drawn here, providing stopping criteria and guides for applying the unfolding operation to program rules  ...  The extension of a tree is done only by Rule 4, which applies only to leaves and extends the branch with one new node. 4.  ... 
doi:10.1007/978-3-642-21498-1_54 fatcat:3gsspvu4trfvvlrxgg6pfns5hm

On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription [chapter]

Tomi Janhunen
1998 Lecture Notes in Computer Science  
Acknowledgments The author thanks Ilkka Niemel for interesting discussions on a draft of this paper and anonymous referees for their comments and suggestions for improvements.  ...  Marek and Truszczy ski 18] reduce a set of defaults D with respect to a propositional theory E L to a set of inference rules D E which contains an inference rule = whenever there is a default rule : 1  ...  Wang et al. 28] use rules of the form 1; : : : ; n with multiple prerequisites, but such rules can be represented as 1^: : :^ n= under propositional closure.  ... 
doi:10.1007/3-540-49545-2_15 fatcat:vnjwopcgwfgvzp6lelpxmt7i7m

A partial taxonomy of judgment aggregation rules and their properties

Jérôme Lang, Gabriella Pigozzi, Marija Slavkovik, Leendert van der Torre, Srdjan Vesic
2016 Social Choice and Welfare  
The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules.  ...  Here we give a structured list of most rules that have been proposed and studied recently in the literature, together with various properties of such rules.  ...  For (b): because every rational extension of J contains ϕ, every rational extension of J is also a rational extension of J ∪ {ϕ}, and obviously a rational extension of J ∪ {ϕ} is also a rational extension  ... 
doi:10.1007/s00355-016-1006-8 fatcat:cacj4hln6bhmxmoszkglkik7yu

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases

Robert Baumgartner, Georg Gottlob
1999 International Joint Conference on Artificial Intelligence  
We analyse the complexity of standard and weak model checking for propositional default logic; in particular, we solve the open problem of complexity in case of normal default theories and introduce a  ...  Rosati for reading an earlier version of this paper and suggesting improvements, and to the referees for several comments.  ...  To obtain this theorem we improve techniques of for guessing data-structures.  ... 
dblp:conf/ijcai/BaumgartnerG99 fatcat:6rowrlvvkbggbctafyiurchj7q

Enhancing Reasoning with the Extension Rule in CDCL SAT Solvers
Amélioration du raisonnement dans les solveurs SAT CDCL avec la règle d'extension

Rodrigue Konan Tchinda, Clémentin Tayou Djamegni
2021 ARIMA  
The extension rule first introduced by G. Tseitin is a simple but powerful rule that, when added to resolution, leads to an exponentially stronger proof system known as extended resolution (ER).  ...  There have been several attempts in the literature aiming at integrating the extension rule within CDCL SAT solvers but the results are in general not as promising as in theory.  ...  rule greatly helped improve the resolution of satisfiable instances.  ... 
doi:10.46298/arima.6434 fatcat:jczlur4jhjcovcpqjrmv4qj4p4
« Previous Showing results 1 — 15 out of 249,695 results