Filters








1,337 Hits in 5.3 sec

AVATAR: The Architecture for First-Order Theorem Provers [chapter]

Andrei Voronkov
2014 Lecture Notes in Computer Science  
Its original motivation comes from a problem wellstudied in the past -dealing with problems having clauses containing propositional variables and other clauses that can be split into components with disjoint  ...  However, even with various versions of splitting, the performance of superposition theorem provers is nowhere near SMT solvers on variable-free problems or SAT solvers on propositional problems.  ...  We thank Krystof Hoder, who implemented the first version of AVATAR, Giles Reger, Laura Kovács and Martin Suda for discussions and reading preliminary versions of this paper.  ... 
doi:10.1007/978-3-319-08867-9_46 fatcat:jpi5e5ag4nbyxljltjtgxf55na

Propositional circumscription and extended closed-world reasoning are ΠP2-complete

Thomas Eiter, Georg Gottlob
1993 Theoretical Computer Science  
Acknowledgment The authors are grateful to the referees for suggesting improvements to the draft of this paper.  ...  All double literal occurrences are removed, and each clause Cl, for 1 <i < I, is split into two clauses Cl, 1, Cl.z in the following way (cf. [lo, p. 481 where M, 2 M.  ...  In the present paper we deal with the complexity of closed-world reasoning applied to general propositional theories and to unrestricted clause sets.  ... 
doi:10.1016/0304-3975(93)90073-3 fatcat:6wn6wewv5jew3iqrecuoig4ihq

Is There a First-Drafter Advantage in M&A?

Adam B. Badawi, Elisabeth de Fontenay
2019 Social Science Research Network  
These findings are consistent with the view that the negotiation process generates frictions and agency costs, which can affect the final deal terms and result in a limited first-drafter advantage.  ...  First, we find that acquirers and sellers prepare the first draft ofthe merger agreement with roughly equalfrequency, contrary to the conventional wisdom that acquirers virtually always draft first.  ...  With respect to deal size, there is a fairly even split between buyer drafting and seller drafting across all categories.1 02 When it comes to acquirer type, the differences are more pronounced.  ... 
doi:10.2139/ssrn.3317622 fatcat:fg2wnhu3ybeyfjyjui2pxj2ase

Degrees of Doxastic Justification

Moritz Schulz
2020 Erkenntnis: An International Journal of Scientific Philosophy  
A theory is offered which accounts for the strength of a derivative belief in terms of (i) the strength of the beliefs on which it is based, and (ii) the epistemic quality of the belief-forming mechanisms  ...  It is shown that the structure of degrees of justification converges to ranking theory under ideal conditions.  ...  Acknowledgements I would like to thank the members of the research group "Knowledge and Decision"-Roman Heil, Jakob Koscholke, Patricia Rich-for extremely helpful comments and suggestions at more than  ... 
doi:10.1007/s10670-020-00334-0 fatcat:o3vdlznjvfhnvjdxpli5xytvr4

An interpersonal sketch of the biblical Hebrew clause

Eric T. Racher
2017 Functional Linguistics  
The aim of the present paper is to describe the Biblical Hebrew clause as a locus of interpersonal meanings from a systemic functional perspective.  ...  The mood structure is also analyzed from below, and the elements salient to the negotiation of meanings in interaction are presented individually and their relevance to the realization of interpersonal  ...  Availability of data and materials Not applicable.  ... 
doi:10.1186/s40554-017-0042-8 fatcat:4mh265qwv5cvvopahrtb6exkje

Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge

Gadi Pinkas
1995 Artificial Intelligence  
An extended version of propositional calculus is developed and is demonstrated to be useful for nonmonotonic reasoning, dealing with conflicting beliefs and for coping with inconsistency generated by unreliable  ...  Intmduction Humans seem to be able to reason about the surrounding world from a noisy and incomplete knowledge with remarkably high speed.  ...  The symbolic approach is too rigid and specialized and is too constrained to be able to deal with exceptions to rules or with the fuzzy or approximate aspects of knowledge (351.  ... 
doi:10.1016/0004-3702(94)00032-v fatcat:vult74eifve7zkhm2vtifkoeey

Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems

Miguel A. Salido, Antonio Garrido, Roman Barták
2008 Engineering applications of artificial intelligence  
Preface The area of AI planning and scheduling has seen important advances thanks to the application of constraint satisfaction and optimization techniques.  ...  The workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, or COPLAS, aims at providing a forum for meeting and exchanging ideas and novel works in the field of AI planning  ...  Acknowledgments This work has been partially supported by a FPI grant from the Spanish government associated to the MICINN project TIN2008-06701-C03-03.  ... 
doi:10.1016/j.engappai.2008.03.007 fatcat:7dv2wdwsmrednf7t6yltucr23y

Chapter 1. Coordination [chapter]

2019 Syntax of Dutch  
Jan will just.as neither the roses prune ALS the tulips plant Second, if we were dealing with correlative coordinators, we would expect the alspart to be obligatory; the cases in (512) show that this is  ...  (although some speakers object to (510b), which we have indicated with the percentage sign).  ...  dealing with two separate propositions but with a single proposition with a complex predicate.  ... 
doi:10.1515/9789048542895-004 fatcat:gver4x7kqbbzhcdxzuf6lnbdle

Non-relational Embedding Verbs: Quotes and Reports

José María García Núñez, Aroa Orrequia-Barea
2020 Complutense Journal of English Studies  
A comparison in the relevant contexts of the related categories of direct and indirect quotation reveals an important degree of coincidence that calls for (a) an overlapping semantic treatment, and (b)  ...  In order to account for these facts, we propose a substantial revision of the Davidsonian approach to clausal complementation.  ...  One way to isolate cases of form quoting is making the negation test operate on synonymous clauses.  ... 
doi:10.5209/cjes.65989 fatcat:ukr7vorru5cnbblxnzm7kfc75a

A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT

Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou
2019 International Journal of Intelligent Decision Technologies  
Selection hyper-heuristics evaluate low-level heuristics and determine which of them to be applied at a given point in the search process.  ...  Hyper-heuristics are high-level methods, used to solve various optimization problems. Some of them are capable of learning and adapting their behavior throughout the solving process.  ...  We had to make a few ad-442 justments to the hyper-heuristic to make it deal with 443 the clusters directly instead of the variables.  ... 
doi:10.3233/idt-180036 fatcat:ad3mg4gl25e27ghesqe3phjuc4

Learning Precedences from Simple Symbol Features

Filip Bartek, Martin Suda
2020 Zenodo  
The system relies on machine learning to extract this information from past successful and unsuccessful runs of a theorem prover over a set of problems and randomly sampled precedences.  ...  A simplification ordering, typically specified by a symbol precedence, is one of the key parameters of the superposition calculus, contributing to shaping the search space navigated by a saturation-based  ...  Acknowledgments Supported by the ERC Consolidator grant AI4REASON no. 649043 under the EU-H2020 programme, the Czech Science Foundation project 20-06390Y and the Grant Agency of the Czech Technical University  ... 
doi:10.5281/zenodo.4584793 fatcat:r2xbwhcatre65eepjgjqmha2gi

An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning [chapter]

Alessio Mansutti
2020 Lecture Notes in Computer Science  
We exhibit these features through an Auxiliary Logic on Trees (ALT), a modal logic that essentially deals with reachability of a fixed node inside a forest and features modalities from sabotage modal logic  ...  We describe a set of simple features that are sufficient in order to make the satisfiability problem of logics interpreted on trees TOWER-hard.  ...  I would like to thank S. Demri and E. Lozes for their feedback. An Auxiliary Logic on Trees  ... 
doi:10.1007/978-3-030-45231-5_24 fatcat:jtkucrw3l5hlvhfuqmdjhfz2di

Conflict analysis in mixed integer programming

Tobias Achterberg
2007 Discrete Optimization  
On infeasible MIPs arising in the context of chip verification and on a model for a particular combinatorial game, the number of nodes was reduced by 80%, thereby reducing the solving time by 50%.  ...  We present heuristics for branch-and-cut solvers to generate valid inequalities from the current infeasible subproblem and the associated branching information.  ...  However, a more appropriate way of dealing with huge amounts of conflict constraints and a better identification of irrelevant constraints would then be needed to avoid overheads on the majority of the  ... 
doi:10.1016/j.disopt.2006.10.006 fatcat:7iknr4b32zhx3k3vtdrcjphk5y

On Incrementality in Dialogue: Evidence from Compound Contributions

Christine Howes, Matthew Purver, Patrick Healey, Gregory Mills, Eleni Gregoromichelaki
2011 Dialogue and Discourse  
They also suggest the need to model higher-level dialogue units that have consequences for the organisation of turn-taking and for the development of a shared context.  ...  We present a corpus study which confirms that CCs are a key dialogue phenomenon: almost 20% of contributions fit our general definition of CCs, with nearly 3% being the cross-person case most often studied  ...  J: [[ For all s-units: does this s-unit end in such a way as to yield a complete proposition or speech act?  ... 
doi:10.5087/dad.2011.111 fatcat:y6e6a4k2efdsfo2dqvxgt5yz2a

Towards an optimal separation of space and length in resolution

Jakob Nordström, Johan Håstad
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
been shown to be intimately connected with both length and space.  ...  There has been a long line of research trying to understand these proof complexity measures, as well as relating them to the width of proofs, i.e., the size of a largest clause in the proof, which has  ...  Acknowledgements We are thankful to Per Austrin and Mikael Goldmann for generous feedback during various stages of this work, and to Gunnar Kreitz for quickly spotting some bugs in a preliminary version  ... 
doi:10.1145/1374376.1374478 dblp:conf/stoc/NordstromH08 fatcat:x2f4caw3rjhjhcho5vohx34o5u
« Previous Showing results 1 — 15 out of 1,337 results