7,596 Hits in 3.1 sec

A Default Logic Patch for Default Logic [chapter]

Philippe Besnard, Éric Grégoire, Sébastien Ramon
2009 Lecture Notes in Computer Science  
More precisely, the focus is on solving the problem that occurs when the standard-logic knowledge parts of the sources are contradictory, as default theories trivialize in this case.  ...  Moreover, it is investigated how these additional defaults interact with the initial defaults of the theory.  ...  On the one hand, we might drop the set-theoretical union of all MUSes, thus removing every minimal (w.r.t. the number of involved formulas) cause of inconsistency.  ... 
doi:10.1007/978-3-642-02906-6_50 fatcat:reolswvvz5gfpc3odscmgfdsaa

Approximate Counting of Minimal Unsatisfiable Subsets [chapter]

Jaroslav Bendík, Kuldeep S. Meel
2020 Lecture Notes in Computer Science  
One such extension is that of counting the number of MUSes.  ...  Our approach avoids exhaustive MUS enumeration by combining the classical technique of universal hashing with advances in QBF solvers along with a novel usage of union and intersection of MUSes to achieve  ...  -We propose a novel approaches for computing the union UMU F and the intersection IMU F of all MUSes of F .  ... 
doi:10.1007/978-3-030-53288-8_21 fatcat:qjocu3fjj5ey7kijkukanzdrhm

Page 70 of National Union Catalog Vol. 7, Issue [page]

1958 National Union Catalog  
International Seminar on Analogue Computation Applied to the Study of Chemical Processes, 1960 see International Seminar on Analogue Computa- tion Applied to the Study of Chemical Processes, Brussels,  ...  The National Union Catalog Brussels. Institut royal des relations internatio- es. Problémes de l'Afrique noire. Bruxelles 11958; (369)-666 p.  ... 

Counting Minimal Unsatisfiable Subsets [chapter]

Jaroslav Bendík, Kuldeep S. Meel
2021 Lecture Notes in Computer Science  
Since MUSes serve as explanations for the unsatisfiability of F, MUSes find applications in a wide variety of domains.  ...  The availability of efficient SAT solvers has aided the development of scalable techniques for finding and enumerating MUSes in the past two decades.  ...  These include, e.g., computing the union of all MUSes [45] , deciding whether a given clause belongs to an MUS [31] , or counting the number of MUSes.  ... 
doi:10.1007/978-3-030-81688-9_15 fatcat:zu6frg7omzh7ff3zm5yqxoe4bm

Finding a Collection of MUSes Incrementally [chapter]

Fahiem Bacchus, George Katsirelos
2016 Lecture Notes in Computer Science  
This allows it to generate multiple MUSes more efficiently; making it more feasible to supply applications with a collection of MUSes rather than just one.  ...  In this paper we describe an algorithm that can efficiently compute a collection of MUSes, thus presenting an application with a range of choices.  ...  Most algorithms for computing MUSes, however, return an arbitrary MUS . There has been some work on the problem of computing specific types of MUSes.  ... 
doi:10.1007/978-3-319-33954-2_3 fatcat:zvjtazmx7rafdg7plh6eskp6ce

Page 441 of National Union Catalog Vol. 14, Issue [page]

1963 National Union Catalog  
The National Union Catalog Dijksterhuis, Eduard Jan, 1892- see Bunt, Lucas Nicolaas Hendrik, The train- ing of a mathematics teacher in the Netherlands, Groningen, J.  ...  A primer of ALGOL 60 programming, together with Report on the algorithmic language ALGOL 60.  ... 

Page 615 of National Union Catalog Vol. 11, Issue [page]

1963 National Union Catalog  
(Series) NK7 215.062 739.2’282 67-98287 NjP Colman, Roberta F Studies on the hanism of t tate decarboxylase. n.p.; 1962. lv. Thesis - Radcliffe, 1962.  ...  The National Union Catalog Gerhard, 1897- Weltwirtschaftliche Forschung im Zeitalter de Koexi- stenz. ,Kiel, Institut fiir Weltwirtschaft an der Univer- othe Lag 1964. 24cm. (Bernhard-Harms-Vor!  ... 

Spatially resolved Lyman-alpha emission from a virtual dwarf galaxy

Anne Verhamme
2014 Proceedings of the International Astronomical Union  
In the context of the first light of MUSE, Integral Field Unit (IFU) spectrograph of second generation installed recently at VLT, we compute mock IFU Lyman-alpha (lyα) observations of a virtual dwarf galaxy  ...  With the same data, we now investigate the spatial variations of lyα spectra.  ...  Figure 1 . 1 Lyα spectra from 9 pixels of the central 3 × 3 kpc of a dwarf galaxy seen face-on, smoothed at the spectral resolution of MUSE (R=4000).  ... 
doi:10.1017/s1743921314009934 fatcat:zt2rjhki4bf5dcqukklst3ymdq

Local-search Extraction of MUSes

Éric Grégoire, Bertrand Mazure, Cédric Piette
2007 Constraints  
It is shown to be the cornerstone of the efficiency of our approach, which outperforms competing ones to compute MUSes, inconsistent covers and sets of MUSes, most of the time.  ...  SAT is probably one of the most-studied constraint satisfaction problems.  ...  One (strict) inconsistent cover IC of an unsatisfiable SAT instance Σ is a set-theoretic union of (independent) MUSes of Σ s.t. Σ\IC is satisfiable.  ... 
doi:10.1007/s10601-007-9019-7 fatcat:cnbxescqrjcqhiygahkpskyefa

Accelerating MUS enumeration by inconsistency graph partitioning

Jie Luo, Shaofan Liu
2019 Science China Information Sciences  
In this paper, a method for accelerating the enumeration of MUSes based on inconsistency graph partitioning is proposed.  ...  Moreover, the MUSes of the original clause set can be constructed by merging the unit clauses in the MUSes of these connected components back into the clauses in the vertex cut.  ...  Compute all minimal unsatisfiable subsets (CAMUS) is one state-of-the-art algorithm for computing all MUSes in this class.  ... 
doi:10.1007/s11432-019-9881-0 fatcat:xgmb5m5qpjfo5f6jcbfeel5eeu

Page 403 of National Union Catalog Vol. 29, Issue [page]

1958 National Union Catalog  
International Conference on the Bio- chemistry of Lipids, 1960 see International Conf: on the Biochemistry of Lipids. 6th, Marseille, 1960.  ...  Development of procedures for rapid computation of dynamic structural response... ,Urbana, 1955,  ... 

Virtual space learning MariMUSE

Billie Hughes, Barry Kort, Jim Walters
1994 ACM SIGCUE Outlook  
Union Telegraph Servii participants in one MUSE world communicate with participants in another.  ...  The Technology Infrastructure The MUSE server runs on a Unix environment on an Internet- connected host computer.  ... 
doi:10.1145/182815.182817 fatcat:sojkxn3tsbb2narnhmbmntrdxq

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets [chapter]

Fahiem Bacchus, George Katsirelos
2015 Lecture Notes in Computer Science  
We show that our algorithms advance the state of the art, enabling more effective computation of muses.  ...  Given an unsatisfiable set F there is a well known hitting set duality between the unsatisfiable subsets of F and the correction subsets of F: every unsatisfiable subset hits (has a non-empty intersection  ...  We further extended this algorithm to generating all muses. These developments hinge in part on our new very efficient mcs extraction algorithm.  ... 
doi:10.1007/978-3-319-21668-3_5 fatcat:c24kuhgbmfdm5bmzne2ffoyafa

Case study

Yung Shin Van Der Sype, Jean-Marc Seigneur
2014 Proceedings of the 29th Annual ACM Symposium on Applied Computing - SAC '14  
Particularly interesting for this study is the storage of the data following from external social network profiles; the retention of the retrieved information processed to compute an extra layer of reputation  ...  The legal requirements considered in this case-study follow from the Belgian implementation of the EU legal framework on privacy and data protection.  ...  in the European Union.  ... 
doi:10.1145/2554850.2554857 dblp:conf/sac/SypeS14 fatcat:fjpsdbyoorcalhqajznwbcgtw4

ICL light in a z~0.5 cluster: the MUSE perspective

E. Pompei, C. Adami
2016 Proceedings of the International Astronomical Union  
We present here the results obtained from MUSE observations of an intermediate redshift (z~ 0.5) cluster taken from the XXL survey and we conclude that the most plausible process responsible for the observed  ...  Intracluster light is contributed by both stars and gas and it is an important tracer of the interaction history of galaxies within a cluster.  ...  The SFR in the ICL, computed using the [OII] line, is of the order of 2.2M /year. 338 E. Pompei et al.  ... 
doi:10.1017/s1743921316011297 fatcat:kde7353kwzbzfle22fakh4vltm
« Previous Showing results 1 — 15 out of 7,596 results