Filters








14 Hits in 2.6 sec

A Tableau Calculus for Non-clausal Maximum Satisfiability [chapter]

Chu Min Li, Felip Manyà, Joan Ramon Soler
<span title="">2019</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We define a non-clausal MaxSAT tableau calculus.  ...  Given a multiset of propositional formulas φ, we prove that the calculus is sound in the sense that if the minimum number of contradictions derived among the branches of a completed tableau for φ is m,  ...  β-rule ¬¬A A ¬-rule l ¬l -rule The single tableau calculus for MaxSAT [18] defined in the literature limits the input to multisets of clauses; i.e., it is a clausal tableau calculus that cannot solve  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-29026-9_4">doi:10.1007/978-3-030-29026-9_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tchuxfxq3zcbza4tdkwpi2v5nu">fatcat:tchuxfxq3zcbza4tdkwpi2v5nu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210715084157/https://digital.csic.es/bitstream/10261/238716/1/A%20Tableau%20Calculus%20for%20Non-clausal%20Maximum%20Satisfiability.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c2/69/c269c6ec1a6f7d1ab736c703d4b1c8790f65fc3e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-29026-9_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Tableaux for Maximum Satisfiability in Łukasiewicz Logic

Chu Min Li, Felip Manya, Amanda Vidal
<span title="">2020</span> <i title="IEEE"> 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL) </i> &nbsp;
We define a tableau calculus for solving the MaxSAT problem of 3-valued Łukasiewicz logic, and prove its soundness and completeness.  ...  Our contributions establish the foundations of a generic problem solving paradigm for combinatorial optimization based on Łukasiewicz logic.  ...  A MAXSAT TABLEAU CALCULUS FOR Ł 3 We formally define a MaxSAT tableau calculus for Ł 3 and prove its soundness and completeness. Definition 6.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ismvl49045.2020.00007">doi:10.1109/ismvl49045.2020.00007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gil3dbo64fgxdjkkkdw7eg5moe">fatcat:gil3dbo64fgxdjkkkdw7eg5moe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210715064929/https://digital.csic.es/bitstream/10261/235754/1/Tableaux%20for%20Maximum%20Satisfiability%20in%20%c5%81ukasiewicz%20Logic.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/e7/88e7f2eef07ab4c131d6b034b1c2649e91fa2e8c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ismvl49045.2020.00007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Probabilistic satisfiability

George Georgakopoulos, Dimitris Kavvadias, Christos H Papadimitriou
<span title="">1988</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hhnp3o4qcjfyfd4gpifcdou6ui" style="color: black;">Journal of Complexity</a> </i> &nbsp;
Since this problem is a generalization of the satisfiability problem for propositional calculus it is immediately NP-hard.  ...  We study the following computational problem proposed by Nils Nilsson: Several clauses (disjunctions of literals) are given, and for each clause the probability that the clause is true is specified.  ...  ACKNOWLEDGMENTS We thank Foto Afrati, Nils Nilsson, and John Tsitsiklis for helpful discussions on this and related problems. This research was partially supported by the National Science Foundation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0885-064x(88)90006-4">doi:10.1016/0885-064x(88)90006-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z247a553hnep7doewbmh6lc5aa">fatcat:z247a553hnep7doewbmh6lc5aa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928000020/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/5aa/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wODg1MDY0eDg4OTAwMDY0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/e4/93e488910f00e213c7f1adc165d5c668c288c6fc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0885-064x(88)90006-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Circular (Yet Sound) Proofs [chapter]

Albert Atserias, Massimo Lauria
<span title="">2019</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Surprisingly, as proof systems for deriving clauses from clauses, Circular Resolution turns out to be equivalent to Sherali-Adams, a proof system for reasoning through polynomial inequalities that has  ...  We introduce a new way of composing proofs in rule-based proof systems that generalizes tree-like and dag-like proofs.  ...  We acknowledge the work of Jordi Coll who conducted experimental results for finding and visualizing actual circular resolution proofs of small instances of the sparse pigeonhole principle.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-24258-9_1">doi:10.1007/978-3-030-24258-9_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qzclgx5oyjgt7bviyim3koz4vu">fatcat:qzclgx5oyjgt7bviyim3koz4vu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200312221902/https://upcommons.upc.edu/bitstream/handle/2117/169630/circularresolution.pdf;jsessionid=49AC632E130253D53E7416AFAA4D931A?sequence=4" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/70/5970c312016c68563386b01a8b05e77338e6c7c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-24258-9_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Automated deduction for verification

Natarajan Shankar
<span title="2009-10-01">2009</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eiea26iqqjcatatlgxdpzt637y" style="color: black;">ACM Computing Surveys</a> </i> &nbsp;
We need a language in which these claims are expressed. We also need a calculus in which these claims are justified and combined to yield new claims. Logic is the calculus of computing.  ...  An atom or its negation is termed a literal. A clause is a disjunction of literals. Any formula can be converted to conjunctive normal form (CNF) where it appears as a conjunction of clauses.  ...  ACKNOWLEDGMENTS Tony Hoare and Jayadev Misra suggested the idea for this survey article and shepherded it through many revisions with copious feedback, advice, and encouragement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1592434.1592437">doi:10.1145/1592434.1592437</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/satgicglyneqvl2nw5pjnr3d3a">fatcat:satgicglyneqvl2nw5pjnr3d3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722020533/http://dream.inf.ed.ac.uk/events/ssfrr-2010/SSFRR_files/CSUR-shankar.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7d/a8/7da8ef946e412139975641b7ea12a19d10c1fe2d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1592434.1592437"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Faster horn diagnosis - a performance comparison of abductive reasoning algorithms

Roxane Koitz-Hristov, Franz Wotawa
<span title="2020-01-28">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/khkbaqss45bgnjenoehwasx35u" style="color: black;">Applied intelligence (Boston)</a> </i> &nbsp;
as a means for abduction.  ...  Abductive inference derives explanations for encountered anomalies and thus embodies a natural approach for diagnostic reasoning.  ...  Inoue [22] , for example, proposes Skipping Ordered Linear (SOL) tableau calculus for extracting consequences of interest equivalent to abductive explanations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10489-019-01575-5">doi:10.1007/s10489-019-01575-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/og3manfccfcofgcd6zywsehwo4">fatcat:og3manfccfcofgcd6zywsehwo4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200509161145/https://link.springer.com/content/pdf/10.1007/s10489-019-01575-5.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a6/27/a6270a3e392afe519a49609fefd1d07a16448dbd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10489-019-01575-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Deduction Beyond Satisfiability (Dagstuhl Seminar 19371)

Carsten Fuhs, Philipp Rümmer, Renate Schmidt, Cesare Tinelli, Michael Wagner
<span title="2020-02-19">2020</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
This is proving to be a key enabler in a variety of areas such as formal methods (for software/hardware development) and knowledge representation and reasoning.  ...  An additional challenge is the lack of common standards for interfacing tools supporting the extended queries.  ...  notion of redundancy, a clause C does not make an instance Cσ redundant.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.9.9.23">doi:10.4230/dagrep.9.9.23</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/FuhsRST19.html">dblp:journals/dagstuhl-reports/FuhsRST19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j6moci5zgvgjzgpsqblemwsrlm">fatcat:j6moci5zgvgjzgpsqblemwsrlm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201212041917/https://drops.dagstuhl.de/opus/volltexte/2020/11843/pdf/dagrep_v009_i009_p023_19371.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/c6/dac6c704ed21b80ef97b749d1e4ab56d89571883.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.9.9.23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On the Generation of Quantified Lemmas

Gabriel Ebner, Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller
<span title="2018-03-23">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2ewief65xnegfh2slwulpgsnba" style="color: black;">Journal of automated reasoning</a> </i> &nbsp;
The method is based on an inversion of Gentzen's cut-elimination method for sequent calculus.  ...  The first step consists of the computation of a compact representation (a so-called decomposition) of Herbrand instances in a cut-free proof.  ...  creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-018-9462-8">doi:10.1007/s10817-018-9462-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cgdjr5lcqvhdvg7xd2hhepxuv4">fatcat:cgdjr5lcqvhdvg7xd2hhepxuv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727183645/https://link.springer.com/content/pdf/10.1007%2Fs10817-018-9462-8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6c/fb/6cfb44dc805378b97d0ecc4eb854aa7915badaee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-018-9462-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Applying algorithm selection to abductive diagnostic reasoning

Roxane Koitz-Hristov, Franz Wotawa
<span title="2018-05-10">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/khkbaqss45bgnjenoehwasx35u" style="color: black;">Applied intelligence (Boston)</a> </i> &nbsp;
In this paper, we investigate algorithm selection as a mechanism to predict the "best" performing technique for a specific abduction scenario within the framework of model-based diagnosis.  ...  Nevertheless, abductive reasoning is an intractable problem and computing solutions for instances of reasonable size and complexity persists to pose a challenge.  ...  In our evaluation, we exploit the consequence finding tool SOLAR 3 [47] , which is a Java implementation of SOL-resolution within the framework of tableau calculus for first order full clausal theories  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10489-018-1171-9">doi:10.1007/s10489-018-1171-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/varekjenirbtvgkkp6plodbmju">fatcat:varekjenirbtvgkkp6plodbmju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727060700/https://link.springer.com/content/pdf/10.1007%2Fs10489-018-1171-9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/37/2d/372d40bc6d336b0bcb1ba794020edaed12f1cb9b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10489-018-1171-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2018 [article]

Formal Methods In Computer Aided Design, Austin, The University Of Texas At, Austin, The University Of Texas At, Nikolaj Bjørner, Arie Gurfinkel
<span title="2019-07-05">2019</span>
The second approach is to treat the neural network as a nonlinear function and to use global optimization techniques for verification.  ...  Therefore, a natural question is whether we can trust decisions that neural networks make. One way to address this issue is to define properties that we want a neural network to satisfy.  ...  funding agency, Fundação para a Ciência e a Tecnologia (FCT) within project POCI-01-0145-FEDER-016826; and within the French Research Agency project FORMEDICIS (ANR-16-CE25-0007).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26153/tsw/2167">doi:10.26153/tsw/2167</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wstjih5duveh5nil62swinyx2m">fatcat:wstjih5duveh5nil62swinyx2m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123085329/https://repositories.lib.utexas.edu/bitstream/handle/2152/75060/fmcad2018_proceedings.pdf;jsessionid=15F97CF7408818431C4F92FEEC27761F?sequence=2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26153/tsw/2167"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Subject Index to Volumes 1–75

<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
a compiler, 737 searching, 8 symbol tables for compilers, 721 symbolic algebraic computation, 2043 calculus, 1188 computation, 117, 341, 2043, 3471 computing, 3448 databases, 3614 dynamics, 3072  ...  , 125 model theoretically, 700 model theory, 95, 2046, 2077, 3392 for program schemas, 95 of the predicate calculus, 95 modeling, 919, 1964, 2562, 2733, 2737, 2923, 3101, 3564, 3863 B- 2078 modularity  ...  constructibility, 3182 detection, 1387 range join, 2933 algorithm, 2933 range of a function, 3993 values, 744 range query, 153, 791, 859, 939, 1304, 1387, 1435, 1658, 1761, 1908, 2235, 2836 querying,  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0020-0190(01)00175-2">doi:10.1016/s0020-0190(01)00175-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5y67tfm6yfbblakrus5nnhs73e">fatcat:5y67tfm6yfbblakrus5nnhs73e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050503052345/http://www.ii.uni.wroc.pl:80/~lorys/IPL/articlesubjindex.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0020-0190(01)00175-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Constraint Satisfaction Problems [chapter]

Grard Verfaillie, Thomas Schiex
<i title="ISTE"> Decision-making Process </i> &nbsp;
Unfortunately, it is rarely clear a priori which algorithm will be most appropriate for a particular problem.  ...  Depth-first search and depth-bounded discrepancy search, for example, make opposite assumptions about the distribution of good leaves.  ...  Theodore Perkins is also supported by a graduate fellowship from the University of Massachusetts Amherst. Acknowledgements The second author is an EPSRC advanced research fellow.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/9780470611876.ch6">doi:10.1002/9780470611876.ch6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/emwz4ax4tbc7bfcreha75g56sy">fatcat:emwz4ax4tbc7bfcreha75g56sy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140806210705/http://ijcai.org/Past%20Proceedings/IJCAI-2001/PDF/IJCAI-2001-c.pdf/IJCAI-2001-c.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/9780470611876.ch6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Deep Learning for Computer Vision (Dagstuhl Seminar 17391) Body-Centric Computing (Dagstuhl Seminar 17392)

Jeremy Blackburn, Emiliano De Cristofaro, Michael Sirivianos, Thorsten Strufe, Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan, Ute Schmid, Stephen Muggleton, Rishabh Singh, Daniel Cremers (+7 others)
<span class="release-stage">unpublished</span>
We formalize agent-based models as stochastic processes whose states are metafinite models, and we define a notion of abstraction.  ...  The organizers would like to thank the Schloss Dagstuhl for the professional, productive, and enjoyable atmosphere it provides and for their invaluable support.  ...  the variables and clauses of F for vertices, and a variable v is adjacent to a clause C if v occurs in C.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7srdlw7mxfhrpiwdxshf2n455y">fatcat:7srdlw7mxfhrpiwdxshf2n455y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180515003343/http://drops.dagstuhl.de/opus/volltexte/2018/8681/pdf/dagrep-v007-i009-complete.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/88/038858d530b477ca786917cbc8966e071a673a34.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Dagstuhl Reports, Volume 9, Issue 9, September 2019, Complete Issue

<span title="">2020</span>
Makowsky Let C be a set of clauses and (V, C, R) a directed graph in which arcs (R) join variables (V ) to clauses (C) with direction according to whether the variable is negated or not in the clause.  ...  Sequent or tableau calculi for such logics are notoriously hard to construct, and often require additional syntactic structure.  ...  A hypertree for G is the degree sequence in Z |Ve| of some spanning tree of G (these form a hypergraphic polymatroid).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.9.9">doi:10.4230/dagrep.9.9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yxieovrp4zbxvhjyyiah6znqxm">fatcat:yxieovrp4zbxvhjyyiah6znqxm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200725095629/https://drops.dagstuhl.de/opus/volltexte/2020/11989/pdf/dagrep-v009-i009-complete.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/39/b5397886dae76dfe344fd1bf68fe1df8df12ae84.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.9.9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>