Relevant bibliographies by topics / Combining logics

Academic literature on the topic 'Combining logics'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combining logics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Combining logics"

1

Jánossy, A., Á. Kurucz, and Á. E. Eiben. "Combining Algebraizable Logics." Notre Dame Journal of Formal Logic 37, no. 2 (April 1996): 366–80. http://dx.doi.org/10.1305/ndjfl/1040046092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

RASGA, JOÃO, CRISTINA SERNADAS, and AMÍLCAR SERNADAS. "PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS." Review of Symbolic Logic 9, no. 4 (August 17, 2016): 641–63. http://dx.doi.org/10.1017/s1755020316000241.

Full text
Abstract:
AbstractAdmissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics, under mild conditions. A weak form of structural completeness is proved to be preserved by the combination. Decidability of the set of admissible rules is also shown to be preserved, with no penalty on the time complexity. Examples are provided for the meet-combination of intermediate and modal logics.
APA, Harvard, Vancouver, ISO, and other styles
3

Gabelaia, D., R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev. "Combining Spatial and Temporal Logics: Expressiveness vs. Complexity." Journal of Artificial Intelligence Research 23 (February 1, 2005): 167–243. http://dx.doi.org/10.1613/jair.1537.

Full text
Abstract:
In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PTL, the spatial logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and `computational realisability' within the hierarchy. We demonstrate how different combining principles as well as spatial and temporal primitives can produce NP-, PSPACE-, EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out of components that are at most NP- or PSPACE-complete.
APA, Harvard, Vancouver, ISO, and other styles
4

RABE, FLORIAN. "A logical framework combining model and proof theory." Mathematical Structures in Computer Science 23, no. 5 (March 1, 2013): 945–1001. http://dx.doi.org/10.1017/s0960129512000424.

Full text
Abstract:
Mathematical logic and computer science have driven the design of a growing number of logics and related formalisms such as set theories and type theories. In response to this population explosion, logical frameworks have been developed as formal meta-languages in which to represent, structure, relate and reason about logics.Research on logical frameworks has diverged into separate communities, often with conflicting backgrounds and philosophies. In particular, two of the most important logical frameworks are the framework of institutions, from the area of model theory based on category theory, and the Edinburgh Logical Framework LF, from the area of proof theory based on dependent type theory. Even though their ultimate motivations overlap – for example in applications to software verification – they have fundamentally different perspectives on logic.In the current paper, we design a logical framework that integrates the frameworks of institutions and LF in a way that combines their complementary advantages while retaining the elegance of each of them. In particular, our framework takes a balanced approach between model theory and proof theory, and permits the representation of logics in a way that comprises all major ingredients of a logic: syntax, models, satisfaction, judgments and proofs. This provides a theoretical basis for the systematic study of logics in a comprehensive logical framework. Our framework has been applied to obtain a large library of structured and machine-verified encodings of logics and logic translations.
APA, Harvard, Vancouver, ISO, and other styles
5

Ågotnes, Thomas, and Natasha Alechina. "Coalition logic with individual, distributed and common knowledge1." Journal of Logic and Computation 29, no. 7 (August 15, 2018): 1041–69. http://dx.doi.org/10.1093/logcom/exv085.

Full text
Abstract:
Abstract Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs. We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both common and distributed knowledge, respectively. Furthermore, we completely characterise the complexity of the satisfiability problem for each of the three logics. We also study logics with interaction axioms connecting coalitional ability and knowledge.
APA, Harvard, Vancouver, ISO, and other styles
6

Dalpiaz, Elena, Violina Rindova, and Davide Ravasi. "Combining Logics to Transform Organizational Agency." Administrative Science Quarterly 61, no. 3 (July 7, 2016): 347–92. http://dx.doi.org/10.1177/0001839216636103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Messing, Barbara. "Combining knowledge with many-valued logics." Data & Knowledge Engineering 23, no. 3 (September 1997): 297–315. http://dx.doi.org/10.1016/s0169-023x(97)00012-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liang, Chuck, and Dale Miller. "A focused approach to combining logics." Annals of Pure and Applied Logic 162, no. 9 (September 2011): 679–97. http://dx.doi.org/10.1016/j.apal.2011.01.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Skjølsvik, Tale. "Combining goods and service-dominant logics in purchasing strategies." Journal of Business & Industrial Marketing 33, no. 8 (October 1, 2018): 1087–99. http://dx.doi.org/10.1108/jbim-09-2017-0220.

Full text
Abstract:
Purpose While goods- and service-dominant logics are separated in most research as alternative and often incompatible paradigms, this paper aims to show how these logics can be and are combined in purchasing strategies in organizations. The paper also illustrates that multiple logics exist in addition to purely goods- or service-based logics. Design/methodology/approach The paper is based on empirical data on the purchasing of management consulting services, which represent an extreme context for understanding the combination and intersection of goods- and service-dominant logics. In particular, four in-depth case studies and interviews with 51 sellers and 30 buyers of management consulting services are used to develop a typology of purchasing approaches that combines goods- and service-dominant logics. Findings The study shows that goods- and service-dominant logics are combined in two main purchasing phases: supplier set selection and assignment selection. In both these phases, parallel and knowledge-based, embedded and experience-based approaches were identified as ways of combining goods- and service-dominant logics in the purchasing context. Research limitations/implications The research presented in the following adds to our existing understanding of possible purchasing strategies under multiple logics in buying organizations. Future research should explore the conditions under which different strategies are and should be applied in organizations. Practical implications This paper gives practitioners alternative approaches to choose from in their purchasing and sales of knowledge-intensive services, in addition to transactional and relational strategies. Originality/value The research adds to existing research on business and industrial marketing by identifying particular purchasing strategies on a continuum between goods- and service-dominant logics.
APA, Harvard, Vancouver, ISO, and other styles
10

Onishi, Tamaki. "Venture Philanthropy and Practice Variations: The Interplay of Institutional Logics and Organizational Identities." Nonprofit and Voluntary Sector Quarterly 48, no. 2 (January 17, 2019): 241–65. http://dx.doi.org/10.1177/0899764018819875.

Full text
Abstract:
While institutional logics and organizational identity become effective theoretical lenses to analyze hybrid organizations, the literature often focuses on tensions between multiple logics or multiple identities and remains relatively silent regarding how logics and identities simultaneously constrain organizations and how organizations respond to incompatibilities as well as compatibilities between logic and identity. To address this gap, the present study draws from burgeoning research that theorizes identity as an integral part of the mechanism from which logics shape organizational decision making. I examined how social-welfare/commercial logics and social/businesslike identities directly and indirectly shape 138 organizations’ practices of venture philanthropy—a hybrid approach combining philanthropy and venture capitalism. The findings confirm identity’s overall mediating effects and offer new theoretical insights into organizational responses to logic–identity incompatibility, especially the dominant role of social identity in consistently suppressing external pressures from commercial logic, whereas businesslike identity overcomes social-welfare logic only associated with the nonprofit status.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Combining logics"

1

Nair, Vineet. "On Extending BDI Logics." Thesis, Griffith University, 2003. http://hdl.handle.net/10072/365892.

Full text
Abstract:
In this thesis we extend BDI logics, which are normal multimodal logics with an arbitrary set of normal modal operators, from three different perspectives. Firstly, based on some recent developments in modal logic, we examine BDI logics from a combining logic perspective and apply combination techniques like fibring/dovetailing for explaining them. The second perspective is to extend the underlying logics so as to include action constructs in an explicit way based on some recent action-related theories. The third perspective is to adopt a non-monotonic logic like defeasible logic to reason about intentions in BDI. As such, the research captured in this thesis is theoretical in nature and situated at the crossroads of various disciplines relevant to Artificial Intelligence (AI). More specifically this thesis makes the following contributions: 1. Combining BDI Logics through fibring/dovetailing: BDI systems modeling rational agents have a combined system of logics of belief, time and intention which in turn are basically combinations of well understood modal logics. The idea behind combining logics is to develop general techniques that allow to produce combinations of existing and well understood logics. To this end we adopt Gabbay's fibring/dovetailing technique to provide a general framework for the combinations of BDI logics. We show that the existing BDI framework is a dovetailed system. Further we give conditions on the fibring function to accommodate interaction axioms of the type G [superscript k,l,m,n] ([diamond][superscript k] [superscript l] [phi] [implies] [superscript m] [diamond][superscript n] [phi]) based on Catach's multimodal semantics. This is a major result when compared with other combining techniques like fusion which fails to accommodate axioms of the above type. 2. Extending the BDI framework to accommodate Composite Actions: Taking motivation from a recent work on BDI theory, we incorporate the notion of composite actions, [pi]-1; [pi]-2 (interpreted as [pi]-1 followed by [pi]-2), to the existing BDI framework. To this end we introduce two new constructs Result and Opportunity which helps in reasoning about the actual execution of such actions. We give a set of axioms that can accommodate the new constructs and analyse the set of commitment axioms as given in the original work in the background of the new framework. 3. Intention reasoning as Defeasible reasoning: We argue for a non-monotonic logic of intention in BDI as opposed to the usual normal modal logic one. Our argument is based on Bratman's policy-based intention. We show that policy-based intention has a defeasible/non-monotonic nature and hence the traditional normal modal logic approach to reason about such intentions fails. We give a formalisation of policy-based intention in the background of defeasible logic. The problem of logical omniscience which usually accompanies normal modal logics is avoided to a great extend through such an approach.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information Technology
Full Text
APA, Harvard, Vancouver, ISO, and other styles
2

Nair, Vineet, and n/a. "On Extending BDI Logics." Griffith University. School of Information Technology, 2003. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20030929.095254.

Full text
Abstract:
In this thesis we extend BDI logics, which are normal multimodal logics with an arbitrary set of normal modal operators, from three different perspectives. Firstly, based on some recent developments in modal logic, we examine BDI logics from a combining logic perspective and apply combination techniques like fibring/dovetailing for explaining them. The second perspective is to extend the underlying logics so as to include action constructs in an explicit way based on some recent action-related theories. The third perspective is to adopt a non-monotonic logic like defeasible logic to reason about intentions in BDI. As such, the research captured in this thesis is theoretical in nature and situated at the crossroads of various disciplines relevant to Artificial Intelligence (AI). More specifically this thesis makes the following contributions: 1. Combining BDI Logics through fibring/dovetailing: BDI systems modeling rational agents have a combined system of logics of belief, time and intention which in turn are basically combinations of well understood modal logics. The idea behind combining logics is to develop general techniques that allow to produce combinations of existing and well understood logics. To this end we adopt Gabbay's fibring/dovetailing technique to provide a general framework for the combinations of BDI logics. We show that the existing BDI framework is a dovetailed system. Further we give conditions on the fibring function to accommodate interaction axioms of the type G [superscript k,l,m,n] ([diamond][superscript k] [superscript l] [phi] [implies] [superscript m] [diamond][superscript n] [phi]) based on Catach's multimodal semantics. This is a major result when compared with other combining techniques like fusion which fails to accommodate axioms of the above type. 2. Extending the BDI framework to accommodate Composite Actions: Taking motivation from a recent work on BDI theory, we incorporate the notion of composite actions, [pi]-1; [pi]-2 (interpreted as [pi]-1 followed by [pi]-2), to the existing BDI framework. To this end we introduce two new constructs Result and Opportunity which helps in reasoning about the actual execution of such actions. We give a set of axioms that can accommodate the new constructs and analyse the set of commitment axioms as given in the original work in the background of the new framework. 3. Intention reasoning as Defeasible reasoning: We argue for a non-monotonic logic of intention in BDI as opposed to the usual normal modal logic one. Our argument is based on Bratman's policy-based intention. We show that policy-based intention has a defeasible/non-monotonic nature and hence the traditional normal modal logic approach to reason about such intentions fails. We give a formalisation of policy-based intention in the background of defeasible logic. The problem of logical omniscience which usually accompanies normal modal logics is avoided to a great extend through such an approach.
APA, Harvard, Vancouver, ISO, and other styles
3

Knorr, Matthias. "Combining open and closed world reasoning for the semantic web." Doctoral thesis, Faculdade de Ciências e Tecnologia, 2011. http://hdl.handle.net/10362/6702.

Full text
Abstract:
Dissertação para obtenção do Grau de Doutor em Informática
One important problem in the ongoing standardization of knowledge representation languages for the Semantic Web is combining open world ontology languages, such as the OWL-based ones, and closed world rule-based languages. The main difficulty of such a combination is that both formalisms are quite orthogonal w.r.t. expressiveness and how decidability is achieved. Combining non-monotonic rules and ontologies is thus a challenging task that requires careful balancing between expressiveness of the knowledge representation language and the computational complexity of reasoning. In this thesis, we will argue in favor of a combination of ontologies and nonmonotonic rules that tightly integrates the two formalisms involved, that has a computational complexity that is as low as possible, and that allows us to query for information instead of calculating the whole model. As our starting point we choose the mature approach of hybrid MKNF knowledge bases, which is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. We extend the two-valued framework of MKNF logics to a three-valued logics, and we propose a well-founded semantics for non-disjunctive hybrid MKNF knowledge bases. This new semantics promises to provide better efficiency of reasoning,and it is faithful w.r.t. the original two-valued MKNF semantics and compatible with both the OWL-based semantics and the traditional Well- Founded Semantics for logic programs. We provide an algorithm based on operators to compute the unique model, and we extend SLG resolution with tabling to a general framework that allows us to query a combination of non-monotonic rules and any given ontology language. Finally, we investigate concrete instances of that procedure w.r.t. three tractable ontology languages, namely the three description logics underlying the OWL 2 pro les.
Fundação para a Ciência e Tecnologia - grant contract SFRH/BD/28745/2006
APA, Harvard, Vancouver, ISO, and other styles
4

Rudolph, Sebastian. "Relational Exploration: Combining Description Logics and Formal Concept Analysis for Knowledge Specification." Doctoral thesis, Technische Universität Dresden, 2006. https://tud.qucosa.de/id/qucosa%3A25002.

Full text
Abstract:
Facing the growing amount of information in today's society, the task of specifying human knowledge in a way that can be unambiguously processed by computers becomes more and more important. Two acknowledged fields in this evolving scientific area of Knowledge Representation are Description Logics (DL) and Formal Concept Analysis (FCA). While DL concentrates on characterizing domains via logical statements and inferring knowledge from these characterizations, FCA builds conceptual hierarchies on the basis of present data. This work introduces Relational Exploration, a method for acquiring complete relational knowledge about a domain of interest by successively consulting a domain expert without ever asking redundant questions. This is achieved by combining DL and FCA: DL formalisms are used for defining FCA attributes while FCA exploration techniques are deployed to obtain or refine DL knowledge specifications.
APA, Harvard, Vancouver, ISO, and other styles
5

Rudolph, Sebastian [Verfasser]. "Relational exploration : combining description logics and formal concept analysis for knowledge specification / von Sebastian Rudolph." Karlsruhe : Univ.-Verl. Karlsruhe, 2007. http://d-nb.info/983756430/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rocktaschel, Tim. "Combining representation learning with logic for language processing." Thesis, University College London (University of London), 2018. http://discovery.ucl.ac.uk/10040845/.

Full text
Abstract:
The current state-of-the-art in many natural language processing and automated knowledge base completion tasks is held by representation learning methods which learn distributed vector representations of symbols via gradient based optimization. They require little or no hand-crafted features, thus avoiding the need for most preprocessing steps and task-specific assumptions. However, in many cases representation learning requires a large amount of annotated training data to generalize well to unseen data. Such labeled training data is provided by human annotators who often use formal logic as the language for specifying annotations. This thesis investigates different combinations of representation learning methods with logic for reducing the need for annotated training data, and for improving generalization. We introduce a mapping of function-free first-order logic rules to loss functions that we combine with neural link prediction models. Using this method, logical prior knowledge is directly embedded in vector representations of predicates and constants. We find that this method learns accurate predicate representations for which no or little training data is available, while at the same time generalizing to other predicates not explicitly stated in rules. However, this method relies on grounding first-order logic rules, which does not scale to large rule sets. To overcome this limitation, we propose a scalable method for embedding implications in a vector space by only regularizing predicate representations. Subsequently, we explore a tighter integration of representation learning and logical deduction. We introduce an end-to-end differentiable prover – a neural network that is recursively constructed from Prolog’s backward chaining algorithm. The constructed network allows us to calculate the gradient of proofs with respect to symbol representations and to learn these representations from proving facts in a knowledge base. In addition to incorporating complex first-order rules, it induces interpretable logic programs via gradient descent. Lastly, we propose recurrent neural networks with conditional encoding and a neural attention mechanism for determining the logical relationship between two natural language sentences.
APA, Harvard, Vancouver, ISO, and other styles
7

Canuto, Anne Magaly de Paula. "Combining neural networks and fuzzy logic for applications in character recognition." Thesis, University of Kent, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.344107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sirin, Evren. "Combining description logic reasoning with AI planning for composition of web services." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/4070.

Full text
Abstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2006.
Thesis research directed by: Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
9

Linker, Sven [Verfasser], Ernst-Rüdiger [Akademischer Betreuer] Olderog, and Michael R. [Akademischer Betreuer] Hansen. "Proofs for traffic safety : combining diagrams and logic / Sven Linker. Betreuer: Ernst-Rüdiger Olderog ; Michael R. Hansen." Oldenburg : BIS der Universität Oldenburg, 2015. http://d-nb.info/106831236X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Linker, Sven Verfasser], Ernst-Rüdiger [Akademischer Betreuer] Olderog, and Michael R. [Akademischer Betreuer] [Hansen. "Proofs for traffic safety : combining diagrams and logic / Sven Linker. Betreuer: Ernst-Rüdiger Olderog ; Michael R. Hansen." Oldenburg : BIS der Universität Oldenburg, 2015. http://d-nb.info/106831236X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Combining logics"

1

Franz, Baader, and Schulz K. U. 1957-, eds. Frontiers of combining systems: First international workshop, Munich, March 1996. Dordrecht: Kluwer Academic Publishers, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Silvio, Ghilardi, and Sebastiani R. (Roberto), eds. Frontiers of combining systems: 7th international symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009 : proceedings. Berlin: Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Trillas, Enric. Combining Experimentation and Theory: A Hommage to Abe Mamdani. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Boris, Konev, and Wolter Frank, eds. Frontiers of combining systems: 6th international symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007 : proceedings. Berlin: Springer, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

FroCoS, 2005 (2005 Vienna Austria). Frontiers of combining systems: 5th international workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005 : proceedings. Berlin: Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

FroCoS 2000 (2000 Nancy, France). Frontiers of combining systems: Third international workshop, FroCoS 2000, Nancy, France, March 22-24, 2000. New York: Springer, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alessandro, Armando, ed. Frontiers of combining systems: 4th international workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002 : proceedings. New York: Springer, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chuvikov, Dmitriy. Models and algorithms for reconstruction and examination of emergency events of road accidents based on logical artificial intelligence. 2nd ed. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1220729.

Full text
Abstract:
The purpose of the monograph is to create a methodology, combined expert and simulation models, as well as algorithms and software-modeling tools for reconstruction and examination of accident events for automating decision-making by an expert center employee. The methodology of combining and algorithms of joint work of an expert system based on logical artificial intelligence (mivar approach) and a simulation system for solving problems of reconstruction and examination of road accidents are developed; model reconstruction and examination of the accident in the formalism of the knowledge base bipartite oriented mivar nets, including analysis formulas braking qualities of the vehicle, determining the speed of a car's performance in terms of specific DTS, the formula for calculating different occasions: - slip car when braking, driving on curved sections of the road, hitting a car on the pedestrian in uniform motion and unlimited visibility; a method of generation of interfaces for designer expert systems based on the concept of mivar approach; special software in the form of expert systems "Analysis of road accident" in order to reduce the complexity of the process of calculating the disputed accidents, errors in the calculation and improve the accuracy and objectivity of the results obtained and the speed and quality of the calculations. It can be useful to specialists of expert institutions, insurance companies, educational institutions in the field of expertise, as well as unmanned vehicles in terms of objective analysis and examination of road accidents.
APA, Harvard, Vancouver, ISO, and other styles
9

Hooker, John. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley & Sons, Incorporated, John, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hooker, John. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley-Interscience, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Combining logics"

1

Schild, Klaus. "Combining terminological logics with tense logic." In Progress in Artificial Intelligence, 105–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57287-2_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baader, Franz, and Klaus U. Schulz. "Combining Constraint Solving." In Constraints in Computational Logics, 104–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45406-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Caleiro, C., P. Mateus, J. Ramos, and A. Sernadas. "Combining Logics: Parchments Revisited." In Recent Trends in Algebraic Development Techniques, 48–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45645-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Areces, Carlos, Raul Fervari, and Guillaume Hoffmann. "Tableaux for Relation-Changing Modal Logics." In Frontiers of Combining Systems, 263–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40885-4_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sakr, Mostafa, and Renate A. Schmidt. "Semantic Forgetting in Expressive Description Logics." In Frontiers of Combining Systems, 118–36. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86205-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Motik, Boris. "Combining Description Logics, Description Graphs, and Rules." In Frontiers of Combining Systems, 43–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04222-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Baader, Franz, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, and Veronika Thost. "Metric Temporal Description Logics with Interval-Rigid Names." In Frontiers of Combining Systems, 60–76. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66167-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Böhme, Stephan, and Marcel Lippmann. "Decidable Description Logics of Context with Rigid Roles." In Frontiers of Combining Systems, 17–32. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24246-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Papacchini, Fabio, and Renate A. Schmidt. "Computing Minimal Models Modulo Subset-Simulation for Modal Logics." In Frontiers of Combining Systems, 279–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40885-4_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Balbiani, Philippe. "Axiomatization and Completeness of Lexicographic Products of Modal Logics." In Frontiers of Combining Systems, 165–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04222-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combining logics"

1

Zhao, Jidi, and Harold Boley. "Combining Fuzzy Description Logics and Fuzzy Logic Programs." In 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. IEEE, 2008. http://dx.doi.org/10.1109/wiiat.2008.363.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gutiérrez-Basulto, Víctor, and Jean Christoph Jung. "Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/149.

Full text
Abstract:
We study combinations of the description logic DL-Lite_{bool}^N with the branching temporal logics CTL* and CTL. We analyse two types of combinations, both with rigid roles: (i) temporal operators are applied to concepts and to ABox assertions, and (ii) temporal operators are applied to concepts and Boolean combinations of concept inclusions and ABox assertions. For the resulting logics, we present algorithms for the satisfiability problem and (mostly tight) complexity bounds ranging from ExpTime to 3ExpTime.
APA, Harvard, Vancouver, ISO, and other styles
3

Madhusudan, P., Gennaro Parlato, and Xiaokang Qiu. "Decidable logics combining heap structures and data." In the 38th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1926385.1926455.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"A Top-down Approach to Combining Logics." In International Conference on Agents and Artificial Intelligence. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004324803460351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shi, Lian, Shuai Lu, Tao Sun, and DanTong Ouyang. "A hybrid system combining intuitionistic fuzzy description logics with intuitionistic fuzzy logic programs." In 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). IEEE, 2011. http://dx.doi.org/10.1109/fskd.2011.6019517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Baelde, David, and Gopalan Nadathur. "Combining Deduction Modulo and Logics of Fixed-Point Definitions." In 2012 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012). IEEE, 2012. http://dx.doi.org/10.1109/lics.2012.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Figueira, Diego, and Leonid Libkin. "Path Logics for Querying Graphs: Combining Expressiveness and Efficiency." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rosati, Riccardo. "The limits and possibilities of combining Description Logics and Datalog." In 2006 Second International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML'06). IEEE, 2006. http://dx.doi.org/10.1109/ruleml.2006.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

van Krieken, Emile, Erman Acar, and Frank van Harmelen. "Analyzing Differentiable Fuzzy Implications." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/92.

Full text
Abstract:
Combining symbolic and neural approaches has gained considerable attention in the AI community, as it is argued that their strengths and weaknesses are complementary. One trend in the literature are weakly supervised learning techniques that employ operators from fuzzy logics. They use prior background knowledge described in such logics to help training neural networks from unlabeled and noisy data. By interpreting logical symbols using neural networks (or grounding them), this background knowledge can be added to regular loss functions, hence making reasoning a part of learning. We investigate how implications from the fuzzy logic literature behave in a differentiable setting. In this setting, we analyze the differences between the formal properties of these fuzzy implications. It turns out that various fuzzy implications, including some of the most well-known, are highly unsuitable for use in a differentiable learning setting. A further finding shows a strong imbalance between gradients driven by the antecedent and the consequent of the implication. Furthermore, we introduce a new family of fuzzy implications (called sigmoidal implications) to tackle this phenomenon. Finally, we empirically show that it is possible to use Differentiable Fuzzy Logics for semi-supervised learning, and show that sigmoidal implications outperform other choices of fuzzy implications.
APA, Harvard, Vancouver, ISO, and other styles
10

Meseguer, J. "Executable computational logics: combining formal methods and programming language based system design." In 2003 1st IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2003). IEEE, 2003. http://dx.doi.org/10.1109/memcod.2003.1210081.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Combining logics"

1

Baader, Franz, and Cesare Tinelli. Combining Equational Theories Sharing Non-Collapse-Free Constructors. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.103.

Full text
Abstract:
In a previous work, we describe a method to combine decision procedures for the word problem for theories sharing constructors. One of the requirements of our combination method is that constructors be collapse-free. This paper removes that requirement by modifying the method so that it applies to non-collapse-free constructors as well. This broadens the scope of our combi- nation results considerably, for example in the direction of equational theories corresponding to modal logics.
APA, Harvard, Vancouver, ISO, and other styles
2

Baader, Franz, Silvio Ghilardi, and Cesare Tinelli. A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.130.

Full text
Abstract:
Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics - which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.
APA, Harvard, Vancouver, ISO, and other styles
3

Baader, Franz, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, and Veronika Thost. Metric Temporal Description Logics with Interval-Rigid Names (Extended Version). Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.233.

Full text
Abstract:
In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a growing interest in extending this work to the quantitative case. In this paper, we complement existing results on the combination of DLs with metric temporal logics over the natural numbers by introducing interval-rigid names. This allows to state that elements in the extension of certain names stay in this extension for at least some specified amount of time.
APA, Harvard, Vancouver, ISO, and other styles
4

Zarrieß, Benjamin, and Jens Claßen. Verification of Knowledge-Based Programs over Description Logic Actions. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.216.

Full text
Abstract:
A knowledge-based program defines the behavior of an agent by combining primitive actions, programming constructs and test conditions that make explicit reference to the agent’s knowledge. In this paper we consider a setting where an agent is equipped with a Description Logic (DL) knowledge base providing general domain knowledge and an incomplete description of the initial situation. We introduce a corresponding new DL-based action language that allows for representing both physical and sensing actions, and that we then use to build knowledge-based programs with test conditions expressed in the epistemic DL. After proving undecidability for the general case, we then discuss a restricted fragment where verification becomes decidable. The provided proof is constructive and comes with an upper bound on the procedure’s complexity.
APA, Harvard, Vancouver, ISO, and other styles
5

Zarrieß, Benjamin, and Patrick Koopmann. On the Complexity of Verifying Timed Golog Programs over Description Logic Actions (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.241.

Full text
Abstract:
Golog programs allow to model complex behaviour of agents by combining primitive actions defined in a Situation Calculus theory using imperative and non-deterministic programming language constructs. In general, verifying temporal properties of Golog programs is undecidable. One way to establish decidability is to restrict the logic used by the program to a Description Logic (DL), for which recently some complexity upper bounds for verification problem have been established. However, so far it was open whether these results are tight, and lightweight DLs such as EL have not been studied at all. Furthermore, these results only apply to a setting where actions do not consume time, and the properties to be verified only refer to the timeline in a qualitative way. In a lot of applications, this is an unrealistic assumption. In this work, we study the verification problem for timed Golog programs, in which actions can be assigned differing durations, and temporal properties are specified in a metric branching time logic. This allows to annotate temporal properties with time intervals over which they are evaluated, to specify for example that some property should hold for at least n time units, or should become specified within some specified time window. We establish tight complexity bounds of the verification problem for both expressive and lightweight DLs. Our lower bounds already apply to a very limited fragment of the verification problem, and close open complexity bounds for the non-metrical cases studied before.
APA, Harvard, Vancouver, ISO, and other styles
6

Wibowo, Johannes, and Jamie López-Soto. Field Jet Erosion Tests on Benbrook Dam, Texas. Engineer Research and Development Center (U.S.), December 2021. http://dx.doi.org/10.21079/11681/42545.

Full text
Abstract:
This report summarizes the results of eight field Jet Erosion Tests (JETs) performed on Benbrook Dam, TX. The results from these tests will be used by the U.S. Army Corps of Engineers, Fort Worth District, in assessments of the erosion resistance of the Benbrook Dam with regards to possible overtopping by extreme flooding. The JETs were performed at four different locations, i.e., two locations at the lowest crest elevation and two locations at the mid-slope face of the downstream embankment. Variations in estimated critical hydraulic shear stress and erosion rate values may have been caused by differences in soil composition, i.e., when the material changed from silt/sand to clay. The resulting values of the Erodibility Coefficient, Kd, and Critical Stress, τc, are very useful information in assessing the stability of Benbrook Dam during an overtopping event. Because of the observed natural variability of the materials, combining the erosion parameters presented in this report with the drilling logs and local geology will be imperative for assessing erosion-related failure modes of Benbrook Dam.
APA, Harvard, Vancouver, ISO, and other styles
7

Akto, P., Z. Chen, and K. Hu. Evaluation of geothermal resource potential of hot sedimentary aquifers in the Horn River Basin, northeast British Columbia, Canada. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331225.

Full text
Abstract:
This study assesses the geothermal potential of Hot Sedimentary Aquifers underlying the Horn River Basin (HRB) based on analyses of borehole temperatures, geological and production data, core porosity and permeability measurements, and geophysical well logs. The proposed criteria are applied to evaluate the geothermal potential of the Horn River Group (HRG) and sub-HRG formations. Favourable spots are identified and ranked by applying temperature, thickness, porosity, permeability and flow rate mapping. The results show that the HRG and its underlying strata have a good potential of geothermal energy resource. Among the HRG formations with an average temperature of 110°C, the Otter Park Formation is the hottest and relatively thick with high water production rate. The Muskwa Formation is the second favourable for geothermal resource potential. Within the sub-HRGs, the Slave Point Formation is the most advantageous because of the high flow rate and high temperature, while the Keg River Formation is the hottest and thickest, and is considered as the second favorable stratigraphic unit. Combining the geological and geographical characteristics, four favourable hot zones have been identified, further indicating that the northwest Zone 1 and the southeast Zone 4 are the hottest areas with thicker reservoirs (>300m) and higher temperatures >130°C (at depth >3 km).
APA, Harvard, Vancouver, ISO, and other styles
8

Yatsymirska, Mariya. SOCIAL EXPRESSION IN MULTIMEDIA TEXTS. Ivan Franko National University of Lviv, February 2021. http://dx.doi.org/10.30970/vjo.2021.49.11072.

Full text
Abstract:
The article investigates functional techniques of extralinguistic expression in multimedia texts; the effectiveness of figurative expressions as a reaction to modern events in Ukraine and their influence on the formation of public opinion is shown. Publications of journalists, broadcasts of media resonators, experts, public figures, politicians, readers are analyzed. The language of the media plays a key role in shaping the worldview of the young political elite in the first place. The essence of each statement is a focused thought that reacts to events in the world or in one’s own country. The most popular platform for mass information and social interaction is, first of all, network journalism, which is characterized by mobility and unlimited time and space. Authors have complete freedom to express their views in direct language, including their own word formation. Phonetic, lexical, phraseological and stylistic means of speech create expression of the text. A figurative word, a good aphorism or proverb, a paraphrased expression, etc. enhance the effectiveness of a multimedia text. This is especially important for headlines that simultaneously inform and influence the views of millions of readers. Given the wide range of issues raised by the Internet as a medium, research in this area is interdisciplinary. The science of information, combining language and social communication, is at the forefront of global interactions. The Internet is an effective source of knowledge and a forum for free thought. Nonlinear texts (hypertexts) – «branching texts or texts that perform actions on request», multimedia texts change the principles of information collection, storage and dissemination, involving billions of readers in the discussion of global issues. Mastering the word is not an easy task if the author of the publication is not well-read, is not deep in the topic, does not know the psychology of the audience for which he writes. Therefore, the study of media broadcasting is an important component of the professional training of future journalists. The functions of the language of the media require the authors to make the right statements and convincing arguments in the text. Journalism education is not only knowledge of imperative and dispositive norms, but also apodictic ones. In practice, this means that there are rules in media creativity that are based on logical necessity. Apodicticity is the first sign of impressive language on the platform of print or electronic media. Social expression is a combination of creative abilities and linguistic competencies that a journalist realizes in his activity. Creative self-expression is realized in a set of many important factors in the media: the choice of topic, convincing arguments, logical presentation of ideas and deep philological education. Linguistic art, in contrast to painting, music, sculpture, accumulates all visual, auditory, tactile and empathic sensations in a universal sign – the word. The choice of the word for the reproduction of sensory and semantic meanings, its competent use in the appropriate context distinguishes the journalist-intellectual from other participants in forums, round tables, analytical or entertainment programs. Expressive speech in the media is a product of the intellect (ability to think) of all those who write on socio-political or economic topics. In the same plane with him – intelligence (awareness, prudence), the first sign of which (according to Ivan Ogienko) is a good knowledge of the language. Intellectual language is an important means of organizing a journalistic text. It, on the one hand, logically conveys the author’s thoughts, and on the other – encourages the reader to reflect and comprehend what is read. The richness of language is accumulated through continuous self-education and interesting communication. Studies of social expression as an important factor influencing the formation of public consciousness should open up new facets of rational and emotional media broadcasting; to trace physical and psychological reactions to communicative mimicry in the media. Speech mimicry as one of the methods of disguise is increasingly becoming a dangerous factor in manipulating the media. Mimicry is an unprincipled adaptation to the surrounding social conditions; one of the most famous examples of an animal characterized by mimicry (change of protective color and shape) is a chameleon. In a figurative sense, chameleons are called adaptive journalists. Observations show that mimicry in politics is to some extent a kind of game that, like every game, is always conditional and artificial.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Combining logics' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography