V. G. Martínez, L. H. Encinas, Agustín Martín, R. Díaz
The distinctive security features of the Spanish electronic national identity card, known as Documento Nacional de Identidad electrónico, allow us to propose the usage of this cryptographic smart card in an authentication framework that can be used during the registration and login phases of internet services where the validation of the user’s age and real identity are key elements, as it is the case for example of the so-called social networks. Using this mechanism with NFC-capable devices, the identity and age of the potential user can be determined, allowing or denying the access to the service based on that information.
西班牙电子国民身份证(documentento Nacional de Identidad electrónico)的独特安全特性，使我们能够在认证框架中使用这种加密智能卡，可以在互联网服务的注册和登录阶段使用，其中验证用户的年龄和真实身份是关键要素，例如所谓的社交网络。在支持nfc的设备上使用这种机制，可以确定潜在用户的身份和年龄，并根据这些信息允许或拒绝对服务的访问。
{"title":"Using the Spanish national identity card in social networks","authors":"V. G. Martínez, L. H. Encinas, Agustín Martín, R. Díaz","doi":"10.1093/jigpal/jzz058","DOIUrl":"https://doi.org/10.1093/jigpal/jzz058","url":null,"abstract":"\u0000 The distinctive security features of the Spanish electronic national identity card, known as Documento Nacional de Identidad electrónico, allow us to propose the usage of this cryptographic smart card in an authentication framework that can be used during the registration and login phases of internet services where the validation of the user’s age and real identity are key elements, as it is the case for example of the so-called social networks. Using this mechanism with NFC-capable devices, the identity and age of the potential user can be determined, allowing or denying the access to the service based on that information.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125450801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In herein article an attempt of problem solution connected with anomaly detection in network traffic with the use of statistic models with long or short memory dependence was presented. In order to select the proper type of a model, the parameter describing memory on the basis of the Geweke and Porter-Hudak test was estimated. Bearing in mind that the value of statistic model depends directly on quality of data used for its creation, at the initial stage of the suggested method, outliers were identified and then removed. For the implementation of this task, the criterion using the value of interquartile range was used. The data prepared in this manner were useful for automatic creation of statistic models classes, such as ARFIMA and Holt-Winters. The procedure of calculation of model parameters’ optimal values was carried out as a compromise between the models coherence and the size of error estimation. Then, relations between the estimated network model and its actual parameters were used in order to detect anomalies in the network traffic. Considering the possibility of appearance of significant real traffic network fluctuations, procedure of updating statistic models was suggested. The results obtained in the course of performed experiments proved efficacy and efficiency of the presented solution.
{"title":"Time series forecasting with model selection applied to anomaly detection in network traffic","authors":"L. Saganowski, T. Andrysiak","doi":"10.1093/jigpal/jzz059","DOIUrl":"https://doi.org/10.1093/jigpal/jzz059","url":null,"abstract":"\u0000 In herein article an attempt of problem solution connected with anomaly detection in network traffic with the use of statistic models with long or short memory dependence was presented. In order to select the proper type of a model, the parameter describing memory on the basis of the Geweke and Porter-Hudak test was estimated. Bearing in mind that the value of statistic model depends directly on quality of data used for its creation, at the initial stage of the suggested method, outliers were identified and then removed. For the implementation of this task, the criterion using the value of interquartile range was used. The data prepared in this manner were useful for automatic creation of statistic models classes, such as ARFIMA and Holt-Winters. The procedure of calculation of model parameters’ optimal values was carried out as a compromise between the models coherence and the size of error estimation. Then, relations between the estimated network model and its actual parameters were used in order to detect anomalies in the network traffic. Considering the possibility of appearance of significant real traffic network fluctuations, procedure of updating statistic models was suggested. The results obtained in the course of performed experiments proved efficacy and efficiency of the presented solution.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121191258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. González, Andrea Vázquez-Ingelmo, F. D. L. Prieta, A. Luis-Reboredo, Alfonso González-Briones
A patent is a property granted to any new shape, configuration or arrangement of elements, of any device, tool, instrument, mechanism or other object or part thereof, that allows for a better or different operation, use or manufacture of the object that incorporates it or that provides it with some utility, advantage or technical effect that it did not have before. As a document, a patent really is a title that recognizes the right to exploit the patented invention exclusively, preventing others from making, selling or using it without the consent of the owner. The fact of making a patent is motivated by the fact of promoting creativity, hindering competition in the market as only one person holds the patent, thus protecting the initial investment and fighting against plagiarism. Patents are available to the public for dissemination and general knowledge. It is generally recognized in the specialized literature that patents can be used as an indicator to calculate the results generated by research and development activities, being a very useful indicator to measure various social, economic or technological aspects. For this reason, it is of relevant interest to have tools or systems that allow us to obtain the patents developed in a specific period of time and to carry out analyses of various economic and social factors. These analyses can serve to obtain a social perspective of society’s progress in the technological field, and this is why an analysis of patents is of our interest. This paper proposes a platform specifically designed to obtain knowledge about patents as an indicator of Spanish social, economic or technological aspects. For this purpose, the platform retrieves, analyses and visualizes functionalities that represent data on the landscape of patents obtained from the Spanish Patent and Trademark Office (OEPM) as a particular case of study.
{"title":"Patent retrieval architecture based on document retrieval. Sketching out the Spanish patent landscape","authors":"A. González, Andrea Vázquez-Ingelmo, F. D. L. Prieta, A. Luis-Reboredo, Alfonso González-Briones","doi":"10.1093/jigpal/jzz055","DOIUrl":"https://doi.org/10.1093/jigpal/jzz055","url":null,"abstract":"A patent is a property granted to any new shape, configuration or arrangement of elements, of any device, tool, instrument, mechanism or other object or part thereof, that allows for a better or different operation, use or manufacture of the object that incorporates it or that provides it with some utility, advantage or technical effect that it did not have before. As a document, a patent really is a title that recognizes the right to exploit the patented invention exclusively, preventing others from making, selling or using it without the consent of the owner. The fact of making a patent is motivated by the fact of promoting creativity, hindering competition in the market as only one person holds the patent, thus protecting the initial investment and fighting against plagiarism. Patents are available to the public for dissemination and general knowledge. It is generally recognized in the specialized literature that patents can be used as an indicator to calculate the results generated by research and development activities, being a very useful indicator to measure various social, economic or technological aspects. For this reason, it is of relevant interest to have tools or systems that allow us to obtain the patents developed in a specific period of time and to carry out analyses of various economic and social factors. These analyses can serve to obtain a social perspective of society’s progress in the technological field, and this is why an analysis of patents is of our interest. This paper proposes a platform specifically designed to obtain knowledge about patents as an indicator of Spanish social, economic or technological aspects. For this purpose, the platform retrieves, analyses and visualizes functionalities that represent data on the landscape of patents obtained from the Spanish Patent and Trademark Office (OEPM) as a particular case of study.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134112059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Simic, E. Corchado, D. Simić, J. Dordevic, S. Simic
In the past 50 years nurse scheduling has received considerable attention in the research community. There are two cases regarding the nurse scheduling problem (NSP): the static and dynamic. Dynamic NSP, is often called nurse rerostering problem (NRRP), which presents reconstruction or modification of the predetermined roster for the current scheduling horizon. The aim of this paper is to present new hybrid strategy for nurse NRRP problem. The proposed methodology is based on efficient cooperation between fuzzy logic, ordered weighted averaging and variable neighbourhood descent search. Complete system is tested, and experimental results are based on real-world dataset obtained from the Oncology Institute of Vojvodina in Serbia.
{"title":"A novel fuzzy metaheuristic approach in nurse rerostering problem","authors":"S. Simic, E. Corchado, D. Simić, J. Dordevic, S. Simic","doi":"10.1093/jigpal/jzz061","DOIUrl":"https://doi.org/10.1093/jigpal/jzz061","url":null,"abstract":"\u0000 In the past 50 years nurse scheduling has received considerable attention in the research community. There are two cases regarding the nurse scheduling problem (NSP): the static and dynamic. Dynamic NSP, is often called nurse rerostering problem (NRRP), which presents reconstruction or modification of the predetermined roster for the current scheduling horizon. The aim of this paper is to present new hybrid strategy for nurse NRRP problem. The proposed methodology is based on efficient cooperation between fuzzy logic, ordered weighted averaging and variable neighbourhood descent search. Complete system is tested, and experimental results are based on real-world dataset obtained from the Oncology Institute of Vojvodina in Serbia.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124904471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Based on his Inclosure Schema and the Principle of Uniform Solution (PUS), Priest has argued that Curry’s paradox belongs to a different family of paradoxes than the Liar. Pleitz (2015, The Logica Yearbook 2014, pp. 233–248) argued that Curry’s paradox shares the same structure as the other paradoxes and proposed a scheme of which the Inclosure Schema is a particular case and he criticizes Priest’s position by pointing out that applying the PUS implies the use of a paraconsistent logic that does not validate Contraction, but that this can hardly seen as uniform. In this paper, we will develop some further reasons to defend Pleitz’ thesis that Curry’s paradox belongs to the same family as the rest of the self-referential paradoxes & using the idea that conditionals are generalized negations. However, we will not follow Pleitz in considering doubtful that there is a uniform solution for the paradoxes in a paraconsistent spirit. We will argue that the paraconsistent strategies can be seen as special cases of the strategy of restricting Detachment and that the latter uniformly blocks all the connective-involving self-referential paradoxes, including Curry’s.
基于他的包含图式和统一解决原则，普里斯特认为库里悖论与说谎者悖论属于不同的悖论家族。Pleitz (2015, The Logica Yearbook 2014, pp. 233-248)认为Curry的悖论与其他悖论具有相同的结构，并提出了一个方案，其中包含模式是一个特殊的案例，他批评了Priest的立场，指出应用PUS意味着使用一种不验证收缩的副一致逻辑，但这很难被视为统一的。在本文中，我们将进一步发展一些理由来捍卫Pleitz的论点，即库里悖论与其他自我参照悖论属于同一家族&使用条件句是广义否定的观点。然而，我们不会跟随Pleitz，怀疑在一种非前后一致的精神中对悖论是否存在统一的解决方案。我们将论证，副一致性策略可以被看作是限制超脱策略的特殊情况，后者统一地阻止了所有涉及连接的自我指涉悖论，包括库里的。
{"title":"When Curry met Abel","authors":"M. Tapia-Navarro, Luis Estrada-González","doi":"10.1093/jigpal/jzaa006","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa006","url":null,"abstract":"\u0000 Based on his Inclosure Schema and the Principle of Uniform Solution (PUS), Priest has argued that Curry’s paradox belongs to a different family of paradoxes than the Liar. Pleitz (2015, The Logica Yearbook 2014, pp. 233–248) argued that Curry’s paradox shares the same structure as the other paradoxes and proposed a scheme of which the Inclosure Schema is a particular case and he criticizes Priest’s position by pointing out that applying the PUS implies the use of a paraconsistent logic that does not validate Contraction, but that this can hardly seen as uniform. In this paper, we will develop some further reasons to defend Pleitz’ thesis that Curry’s paradox belongs to the same family as the rest of the self-referential paradoxes & using the idea that conditionals are generalized negations. However, we will not follow Pleitz in considering doubtful that there is a uniform solution for the paradoxes in a paraconsistent spirit. We will argue that the paraconsistent strategies can be seen as special cases of the strategy of restricting Detachment and that the latter uniformly blocks all the connective-involving self-referential paradoxes, including Curry’s.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125171320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this article, we present a new logical framework to think about surprise. This research does not just aim to better understand, model and predict human behaviour, but also attempts to provide tools for implementing artificial agents. Moreover, these artificial agents should then also be able to reap the same epistemic benefits from surprise as humans do. We start by discussing the dominant literature regarding propositional surprise and explore its shortcomings. These shortcomings are of both an empirical and a conceptual nature. Next, we propose a philosophical solution to the problems that ail these systems, based on the notion of issue of epistemic interest. Finally, we give a formal framework to think about surprise. More specifically, we develop a probabilistic dynamic epistemic logic (called $mathcal{SURPRISE!}$) that succeeds at formalizing the relevant philosophical concepts. This will be done through an issue management system grounded in topology. As an added bonus, the additional expressive power allows us to capture a richer variety of scenarios, and it also enables a more careful analysis of said scenarios.
{"title":"The perfect surprise: a new analysis in dynamic epistemic logic","authors":"Leander Vignero, L. Demey","doi":"10.1093/jigpal/jzz031","DOIUrl":"https://doi.org/10.1093/jigpal/jzz031","url":null,"abstract":"\u0000 In this article, we present a new logical framework to think about surprise. This research does not just aim to better understand, model and predict human behaviour, but also attempts to provide tools for implementing artificial agents. Moreover, these artificial agents should then also be able to reap the same epistemic benefits from surprise as humans do. We start by discussing the dominant literature regarding propositional surprise and explore its shortcomings. These shortcomings are of both an empirical and a conceptual nature. Next, we propose a philosophical solution to the problems that ail these systems, based on the notion of issue of epistemic interest. Finally, we give a formal framework to think about surprise. More specifically, we develop a probabilistic dynamic epistemic logic (called $mathcal{SURPRISE!}$) that succeeds at formalizing the relevant philosophical concepts. This will be done through an issue management system grounded in topology. As an added bonus, the additional expressive power allows us to capture a richer variety of scenarios, and it also enables a more careful analysis of said scenarios.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134498855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Extending the relation between semi-Heyting algebras and semi-Nelson algebras to dually hemimorphic semi-Heyting algebras, we introduce and study the variety of dually hemimorphic semi-Nelson algebras and some of its subvarieties. In particular, we prove that the category of dually hemimorphic semi-Heyting algebras is equivalent to the category of dually hemimorphic centered semi-Nelson algebras. We also study the lattice of congruences of a dually hemimorphic semi-Nelson algebra through some of its deductive systems.
{"title":"Dually hemimorphic semi-Nelson algebras","authors":"J. M. Cornejo, H. J. S. Martín","doi":"10.1093/jigpal/jzz030","DOIUrl":"https://doi.org/10.1093/jigpal/jzz030","url":null,"abstract":"\u0000 Extending the relation between semi-Heyting algebras and semi-Nelson algebras to dually hemimorphic semi-Heyting algebras, we introduce and study the variety of dually hemimorphic semi-Nelson algebras and some of its subvarieties. In particular, we prove that the category of dually hemimorphic semi-Heyting algebras is equivalent to the category of dually hemimorphic centered semi-Nelson algebras. We also study the lattice of congruences of a dually hemimorphic semi-Nelson algebra through some of its deductive systems.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131799996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we continue the study of the Łukasiewicz residuation algebras of order $n$ with Moisil possibility operators (or $MC_n$-algebras) initiated by Figallo (1989, PhD Thesis, Universidad Nacional del Sur). More precisely, among other things, a method to determine the number of elements of the $MC_n$-algebra with a finite set of free generators is described. Applying this method, we find again the results obtained by Iturrioz and Monteiro (1966, Rev. Union Mat. Argent., 22, 146) and by Figallo (1990, Rep. Math. Logic, 24, 3–16) for the case of Tarski algebras and $IvarDelta _{3}$-algebras, respectively.
本文继续研究了Figallo(1989，博士论文，国立南方大学)提出的具有Moisil可能性算子的$n$阶Łukasiewicz残馀代数(或$MC_n$-代数)。更准确地说，在其他方面，一种方法来确定$MC_n$-代数的元素的数量与有限的一组自由生成器描述。应用这种方法，我们再次发现Iturrioz和Monteiro (1966, Rev. Union Mat. Argent)的结果。菲加洛(1990年，马萨诸塞州众议员)。关于Tarski代数和$IvarDelta _{3}$-代数的情形，逻辑学报，24,3 - 16)。
{"title":"Cn algebras with Moisil possibility operators","authors":"A. Figallo, G. Pelaitay, J. Sarmiento","doi":"10.1093/jigpal/jzaa012","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa012","url":null,"abstract":"\u0000 In this paper, we continue the study of the Łukasiewicz residuation algebras of order $n$ with Moisil possibility operators (or $MC_n$-algebras) initiated by Figallo (1989, PhD Thesis, Universidad Nacional del Sur). More precisely, among other things, a method to determine the number of elements of the $MC_n$-algebra with a finite set of free generators is described. Applying this method, we find again the results obtained by Iturrioz and Monteiro (1966, Rev. Union Mat. Argent., 22, 146) and by Figallo (1990, Rep. Math. Logic, 24, 3–16) for the case of Tarski algebras and $IvarDelta _{3}$-algebras, respectively.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Thiago Nascimento, U. Rivieccio, J. Martin Marcos, M. Spinks
Besides the better-known Nelson logic ($mathcal{N}3$) and paraconsistent Nelson logic ($mathcal{N}4$), in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called $mathcal{S}$. The logic $mathcal{S}$ was originally presented by means of a calculus (crucially lacking the contraction rule) with infinitely many rule schemata and no semantics (other than the intended interpretation into Arithmetic). We look here at the propositional fragment of $mathcal{S}$, showing that it is algebraizable (in fact, implicative), in the sense of Blok and Pigozzi, with respect to a variety of three-potent involutive residuated lattices. We thus introduce the first known algebraic semantics for $mathcal{S}$ as well as a finite Hilbert-style calculus equivalent to Nelson’s presentation; this also allows us to clarify the relation between $mathcal{S}$ and the other two Nelson logics $mathcal{N}3$ and $mathcal{N}4$.
{"title":"Nelson's logic ℒ","authors":"Thiago Nascimento, U. Rivieccio, J. Martin Marcos, M. Spinks","doi":"10.1093/jigpal/jzaa015","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa015","url":null,"abstract":"\u0000 Besides the better-known Nelson logic ($mathcal{N}3$) and paraconsistent Nelson logic ($mathcal{N}4$), in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called $mathcal{S}$. The logic $mathcal{S}$ was originally presented by means of a calculus (crucially lacking the contraction rule) with infinitely many rule schemata and no semantics (other than the intended interpretation into Arithmetic). We look here at the propositional fragment of $mathcal{S}$, showing that it is algebraizable (in fact, implicative), in the sense of Blok and Pigozzi, with respect to a variety of three-potent involutive residuated lattices. We thus introduce the first known algebraic semantics for $mathcal{S}$ as well as a finite Hilbert-style calculus equivalent to Nelson’s presentation; this also allows us to clarify the relation between $mathcal{S}$ and the other two Nelson logics $mathcal{N}3$ and $mathcal{N}4$.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"2013 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132679628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guillermo De Ita, J. R. Marcial-Romero, J. A. H. Servín
Counting models for a two conjunctive formula (2-CF) $F$, a problem known as $sharp $2Sat, is a classic $sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $sharp $2Sat($F$) can be computed efficiently. In this paper, we address the case when $G$ has cycles. When $G$ is cyclic, we propose a decomposition on the constraint graph $G$ that allows the computation of $sharp $2Sat($F$) in incremental way. Let $T$ be a cactus graph of $G$ containing a maximal number of independent cycles, and let $overline{T}=(E(G)-E(T))$ be a subset of frond edges from $G$. The clauses in $overline{T}$ are ordered in connected components ${K_1, ldots , K_r}$. Each $(G cup K_i), i=1,ldots ,r$ is a knot (a set of intersected cycles) of the graph. The arrangement of the clauses of $overline{T}$ allows the decomposition of $G$ in knots and provides a way of computing $sharp $2Sat(F) in an incremental way. Our procedure has a bottom-up orientation for the computation of $sharp $2Sat($F$). It begins with $F_0 = T$. In each iteration of the procedure, a new clause $C_i in overline{T}$ is considered in order to form $F_i = (F_{i-1} wedge C_i)$ and then to compute $sharp $2Sat$(F_i)$ based on the computation of $sharp $2Sat$(F_{i-1})$.
{"title":"A bottom-up algorithm for solving ♯2SAT","authors":"Guillermo De Ita, J. R. Marcial-Romero, J. A. H. Servín","doi":"10.1093/jigpal/jzaa009","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa009","url":null,"abstract":"\u0000 Counting models for a two conjunctive formula (2-CF) $F$, a problem known as $sharp $2Sat, is a classic $sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $sharp $2Sat($F$) can be computed efficiently. In this paper, we address the case when $G$ has cycles.\u0000 When $G$ is cyclic, we propose a decomposition on the constraint graph $G$ that allows the computation of $sharp $2Sat($F$) in incremental way. Let $T$ be a cactus graph of $G$ containing a maximal number of independent cycles, and let $overline{T}=(E(G)-E(T))$ be a subset of frond edges from $G$. The clauses in $overline{T}$ are ordered in connected components ${K_1, ldots , K_r}$. Each $(G cup K_i), i=1,ldots ,r$ is a knot (a set of intersected cycles) of the graph.\u0000 The arrangement of the clauses of $overline{T}$ allows the decomposition of $G$ in knots and provides a way of computing $sharp $2Sat(F) in an incremental way. Our procedure has a bottom-up orientation for the computation of $sharp $2Sat($F$). It begins with $F_0 = T$. In each iteration of the procedure, a new clause $C_i in overline{T}$ is considered in order to form $F_i = (F_{i-1} wedge C_i)$ and then to compute $sharp $2Sat$(F_i)$ based on the computation of $sharp $2Sat$(F_{i-1})$.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132817526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：