Готові списки джерел за темами / Constraint logic

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Constraint logic"

Автор: Grafiati

Опубліковано: 7 червня 2025

Оновлено: 2 серпня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Constraint logic".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Constraint logic"

FAGES, FRANÇOIS, and EMMANUEL COQUERY. "Typing constraint logic programs." Theory and Practice of Logic Programming 1, no. 6 (2001): 751–77. http://dx.doi.org/10.1017/s1471068401001120.

Повний текст джерела

Анотація:

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs and modules, while maintaining the capabilities of performing the usual coercions between constraint domains, and of typing meta-programming predicates, thanks to the exibility of subtyping. The property of subject reduction expresses the consistency of a prescriptive type system w.r.t. the execution model: if a program is ‘well-typed’, then all deriva

Стилі APA, Harvard, Vancouver, ISO та ін.

Van Hentenryck, Pascal. "Constraint logic programming." Knowledge Engineering Review 6, no. 3 (1991): 151–94. http://dx.doi.org/10.1017/s0269888900005798.

Повний текст джерела

Анотація:

AbstractConstraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency of constraint-solving algorithms. For some classes of combinatorial search problems, they shorten the development time significantly while preserving most of the efficiency of imperative languages. This paper surveys this new class of programming languages from thei

Стилі APA, Harvard, Vancouver, ISO та ін.

DUNDUA, BESIK, MÁRIO FLORIDO, TEMUR KUTSIA, and MIRCEA MARIN. "CLP(H):Constraint logic programming for hedges." Theory and Practice of Logic Programming 16, no. 2 (2015): 141–62. http://dx.doi.org/10.1017/s1471068415000071.

Повний текст джерела

Анотація:

AbstractCLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebraic semantics of CLP(H) programs, define a sound, terminating, and incomplete constraint solver, investigate two fragments of constraints for which the solver returns a complete set of solutions,

Стилі APA, Harvard, Vancouver, ISO та ін.

DIACONESCU, RĂZVAN. "Category-based constraint logic." Mathematical Structures in Computer Science 10, no. 3 (2000): 373–407. http://dx.doi.org/10.1017/s0960129599002960.

Повний текст джерела

Анотація:

The research reported in this paper exploits the view of constraint programming as computation in a logical system, namely constraint logic. The basic ingredients of constraint logic are: constraint models for the semantics (they form a comma-category over a fixed model of ‘built-ins’); generalized polynomials in the role of basic syntactic ingredient; and a constraint satisfaction relation between semantics and syntax. Category-based constraint logic means the development of the logic is abstract categorical rather than concrete set theoretical.We show that (category-based) constraint logic i

Стилі APA, Harvard, Vancouver, ISO та ін.

Van Hentenryck, Pascal, Helmut Simonis, and Mehmet Dincbas. "Constraint satisfaction using constraint logic programming." Artificial Intelligence 58, no. 1-3 (1992): 113–59. http://dx.doi.org/10.1016/0004-3702(92)90006-j.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cohen, Jacques. "Logic programming and constraint logic programming." ACM Computing Surveys 28, no. 1 (1996): 257–59. http://dx.doi.org/10.1145/234313.234416.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

FIERBINTEANU, CRISTINA. "CONSTRAINT LOGIC PROGRAMMING APPROACH OF NETWORK FLOW PROBLEMS WITHIN A DECISION SUPPORT SYSTEMS GENERATOR FOR TRANSPORTATION PLANNIG." International Journal on Artificial Intelligence Tools 07, no. 04 (1998): 453–62. http://dx.doi.org/10.1142/s0218213098000214.

Повний текст джерела

Анотація:

In this paper we propose a model of a decision support systems (DSS) generator for unstructured problems. The model is developed within the constraint logic programming (CLP) paradigm. At the center of the generator there is an ontology defining the concepts and relationships necessary and sufficient to describe the domain to be reasoned about, in a manner suitable for a particular class of tasks. The constraint solver of the constraint logic programming host language has to be extended with constraints which are relevant to the domain studied, but can not be found among the general constraint

Стилі APA, Harvard, Vancouver, ISO та ін.

Diaconescu, Răzvan. "Completeness of category-based equational deduction." Mathematical Structures in Computer Science 5, no. 1 (1995): 9–40. http://dx.doi.org/10.1017/s0960129500000621.

Повний текст джерела

Анотація:

Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and valuations as model morphisms rather than functions. Applications include many- and order-sorted (conditional) equational logics, Horn clause logic, equational deduction modulo a theory, constraint logics, and more, as well as any possible combination among them. In the cases of equational deduction modulo a theory and of constraint logic the comple

Стилі APA, Harvard, Vancouver, ISO та ін.

APT, KRZYSZTOF R., and ERIC MONFROY. "Constraint programming viewed as rule-based programming." Theory and Practice of Logic Programming 1, no. 6 (2001): 713–50. http://dx.doi.org/10.1017/s1471068401000072.

Повний текст джерела

Анотація:

We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined, explicitly given constraints. To solve them we first derive rules from these explicitly given constraints and limit the computation process to a repeated application of these rules, combined with labeling. We consider two types of rule here. The first type, that we

Стилі APA, Harvard, Vancouver, ISO та ін.

Huang, Peixin, Xiang Zhao, Minghao Hu, Zhen Tan, and Weidong Xiao. "Logic Induced High-Order Reasoning Network for Event-Event Relation Extraction." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 23 (2025): 24141–49. https://doi.org/10.1609/aaai.v39i23.34589.

Повний текст джерела

Анотація:

To understand a document with multiple events, event-event relation extraction (ERE) emerges as a crucial task, aiming to discern how natural events temporally or structurally associate with each other. To achieve this goal, our work addresses the problems of temporal event relation extraction (TRE) and subevent relation extraction (SRE). The latest methods for such problems have commonly built document-level event graphs for global reasoning across sentences. However, the edges between events are usually derived from external tools heuristically, which are not always reliable and may introduc

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Constraint logic"

Chalmers, Stuart W. "Agents and constraint logic." Thesis, University of Aberdeen, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401585.

Повний текст джерела

Анотація:

Using Constraint Logic Programming and a data model approach, we provide an agent with a flexible way to plan and direct its actions and to manipulate and represent its knowledge. We use constraint solving techniques developed in the KRAFT project to provide the agent with a sophisticated reasoning and deliberation process. We explore the declarative use of constraints within a BDI Agent framework to represent knowledge as complex quantified constraints and apply these techniques to a courier scenario where cooperating agents communicate, delegate and exchange desires and information using Gen

Стилі APA, Harvard, Vancouver, ISO та ін.

Wetsel, Gerhard. "Abductive and constraint logic programming." Thesis, Imperial College London, 1997. http://hdl.handle.net/10044/1/7212.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Martin, Barnaby D. "Logic, computation and constraint satisfaction." Thesis, University of Leicester, 2005. http://hdl.handle.net/2381/30530.

Повний текст джерела

Анотація:

We study a class of non-deterministic program schemes with while loops: firstly, augmented with a priority queue for memory; secondly, augmented with universal quantification; and, thirdly, augmented with universal quantification and a stack for memory. We try to relate these respective classes of program schemes to well-known complexity classes and logics.;We study classes of structure on which path system logic coincides with polynomial time P.;We examine the complexity of generalisations of non-uniform boolean constraint satisfaction problems, where the inputs may have a bounded number of q

Стилі APA, Harvard, Vancouver, ISO та ін.

Weidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.

Повний текст джерела

Анотація:

The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking. Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obt

Стилі APA, Harvard, Vancouver, ISO та ін.

Reddy, Pamoori Venkateswara. "Tableau systems for tense logics : a constraint approach." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283438.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Madelaine, Florent. "Constraint satisfaction problems and related logic." Thesis, University of Leicester, 2003. http://hdl.handle.net/2381/30524.

Повний текст джерела

Анотація:

Feder and Vardi have proved that the class captured by a monadic fragment of existential second-order logic, MMSNP, is computationally equivalent (via randomised reductions) to the class of constraint satisfaction problems (CSP) while the latter is strictly included in the former. I introduce a new class of combinatorial problems, the so-called forbidden patterns problems (FP), that correspond exactly to the logic MMSNP and introduce some novel algebraic tools like the re-colouring that allow me to construct a normal form. This leads to a constructive characterisation of the borderline of CSP

Стилі APA, Harvard, Vancouver, ISO та ін.

CATTAFI, Massimiliano. "LOGIC AND CONSTRAINT PROGRAMMING FOR COMPUTATIONAL SUSTAINABILITY." Doctoral thesis, Università degli studi di Ferrara, 2012. http://hdl.handle.net/11392/2388775.

Повний текст джерела

Анотація:

Computational Sustainability is an interdisciplinary field that aims to develop computational and mathematical models and methods for decision making concerning the management and allocation of resources in order to help solve environmental problems. This thesis deals with a broad spectrum of such problems (energy efficiency, water management, limiting greenhouse gas emissions and fuel consumption) giving a contribution towards their solution by means of Logic Programming (LP) and Constraint Programming (CP), declarative paradigms from Artificial Intelligence of proven solidity. The p

Стилі APA, Harvard, Vancouver, ISO та ін.

Padmanabhuni, Srinivas. "Logic programming with stable models for constraint satisfaction." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0009/NQ60011.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pippin, William E. Jr. "Optimizing Threads of Computation in Constraint Logic Programs." The Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1041551800.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Bai. "Constraint-based reasoning in artificial intelligence." Thesis, University of Nottingham, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282033.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Constraint logic"

Vlahavas, Ioannis. Parallel and constraint logic programming: An introduction to logic, parallelism and constraints. Kluwer Academic Publishers, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vlahavas, Ioannis. Parallel and Constraint Logic Programming: An Introduction to Logic, Parallelism and Constraints. Springer US, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hanus, Michael, and Claudio Sacerdoti Coen, eds. Functional and Constraint Logic Programming. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75333-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Escobar, Santiago, ed. Functional and Constraint Logic Programming. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11999-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kuchen, Herbert, ed. Functional and Constraint Logic Programming. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22531-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mariño, Julio, ed. Functional and Constraint Logic Programming. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20775-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vlahavas, Ioannis, Panagiotis Tsarchopoulos, and Ilias Sakellariou. Parallel and Constraint Logic Programming. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5119-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Silva, Josep, ed. Functional and Constraint Logic Programming. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16202-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hentenryck, Pascal Van. Constraint satisfaction in logic programming. MIT Press, 1989.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Frédéric, Benhamou, and Colmerauer A, eds. Constraint logic programming: Selected research. MIT Press, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Constraint logic"

Schrijvers, Tom. "Constraint Handling Rules." In Logic Programming. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89982-2_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Beldiceanu, Nicolas, and Emmanuel Poder. "The period Constraint." In Logic Programming. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27775-0_23.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wallace, Mark. "Constraint Logic Programming." In Computational Logic: Logic Programming and Beyond. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45628-7_19.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Frühwirth, Thom, Alexander Herold, Volker Küchenhoff, et al. "Constraint Logic Programming." In Logic Programming in Action. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55930-2_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vlahavas, Ioannis, Panagiotis Tsarchopoulos, and Ilias Sakellariou. "Constraint Logic Programming." In Parallel and Constraint Logic Programming. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5119-5_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Frühwirth, Thom, and Slim Abdennadher. "Constraint Logic Programming." In Cognitive Technologies. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-662-05138-2_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Raedt, Luc, and Wim Laer. "Inductive constraint logic." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60454-5_30.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Barth, Peter. "Constraint Logic Programming." In Operations Research/Computer Science Interfaces Series. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1315-1_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gavanelli, Marco, and Francesca Rossi. "Constraint Logic Programming." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14309-0_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mints, Grigori. "Resolution Strategies for the Intuitionistic Logic." In Constraint Programming. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-85983-0_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Constraint logic"

Roisin, Mathieu, Pierre-Alain Yvars, and Bernard Riera. "Constraint Programming for Logic controller Synthesis." In 2024 10th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2024. http://dx.doi.org/10.1109/codit62066.2024.10708360.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Garreau, Bryan, Martin Dieguez Lodeiro, Eric Monfroy, and Igor Stéphan. "Introducing Constraint Well-Founded Semantics for Constraint Logic Programming Through Rewriting Transformations." In 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2024. https://doi.org/10.1109/ictai62512.2024.00062.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Smrithi, Allada, Alimili Varshini, Valluru Venkata Sai Bhavitha Reddy, T. V. Smitha, and N. Neelima. "Multi-Depot Pickup and Delivery Problem Optimization with Constraint Logic Programming." In 2025 International Conference on Computational Innovations and Engineering Sustainability (ICCIES). IEEE, 2025. https://doi.org/10.1109/iccies63851.2025.11032540.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Okulmus, Cem, and Mantas Šimkus. "SHACL Validation under the Well-founded Semantics." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/52.

Повний текст джерела

Анотація:

W3C has recently introduced SHACL as a new standard for writing integrity constraints on graph-structured data (specifically, on RDF graphs). Unfortunately, the standard defines the semantics of non-recursive constraints only, leaving the case of recursive constraints open. This has spurred recent research efforts into finding a suitable, mathematically crisp semantics for constraints with cyclic dependencies. In this paper, we argue that recursive SHACL can be naturally equipped with a semantics inspired in the well-founded semantics for recursive logic programs with default negation. This se

Стилі APA, Harvard, Vancouver, ISO та ін.

Jaffar, J., and J. L. Lassez. "Constraint logic programming." In the 14th ACM SIGACT-SIGPLAN symposium. ACM Press, 1987. http://dx.doi.org/10.1145/41625.41635.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wu, J. K., J. H. Wang, C. X. Feng, and T. H. Liu. "A Logic-Based Mechanical System Constraint Model." In ASME 1993 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/edm1993-0115.

Повний текст джерела

Анотація:

Abstract This paper presents some initial developments in modeling design constraints of mechanical systems using predicate logic. This design constraint modeling method is to manage design changes in a concurrent engineering environment that has CAE and CAM applications. The design constraints are classified according to an object hierarchy of a mechanical system information model which has five levels object including: a mechanical system level, assembly level, and part level. The constraint relationships are defined and formally expressed using predicate logic. Feature fitting and against r

Стилі APA, Harvard, Vancouver, ISO та ін.

Philips, Nicholas C. "Channel routing by constraint logic." In the 1992 ACM/SIGAPP Symposium. ACM Press, 1992. http://dx.doi.org/10.1145/143559.143684.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dageförde, Jan C., and Herbert Kuchen. "A constraint-logic object-oriented language." In SAC 2018: Symposium on Applied Computing. ACM, 2018. http://dx.doi.org/10.1145/3167132.3167260.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dewey, Kyle, Jared Roesch, and Ben Hardekopf. "Language fuzzing using constraint logic programming." In ASE '14: ACM/IEEE International Conference on Automated Software Engineering. ACM, 2014. http://dx.doi.org/10.1145/2642937.2642963.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Mesnard, Fred, Étienne Payet, and Germán Vidal. "Selective unification in constraint logic programming." In PPDP'17: 19th International Symposium on Principles and Practice of Declarative Programming. ACM, 2017. http://dx.doi.org/10.1145/3131851.3131863.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Constraint logic"

Lutz, Carsten, and Frank Wolter. Modal Logics of Topological Relations. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.142.

Повний текст джерела

Анотація:

The eight topological RCC8(or Egenhofer-Franzosa)- relations between spatial regions play a fundamental role in spatial reasoning, spatial and constraint databases, and geographical information systems. In analogy with Halpern and Shoham’s modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the RCC8-relations. The semantics is based on region spaces induced by standard topological spaces, in particular the real plane. We investigate the expressive power and computational complexity of the

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Stefan Borgwardt, and Barbara Morawska. Dismatching and Local Disunification in EL. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.210.

Повний текст джерела

Анотація:

Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic EL to disunification since negative constraints on unifiers can be used to avoid unwanted unifiers. While decidability of the solvability of general EL-disunification problems remains an open problem, we obtain NP-completeness results for two interesting special cases: dismatching problems, where one side of each negative constraint must be ground, and local solvability of disunification problems, where w

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz. Concept Descriptions with Set Constraints and Cardinality Constraints. Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.232.

Повний текст джерела

Анотація:

We introduce a new description logic that extends the well-known logic ALCQ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of ALCQ. To formulate these constraints, we use the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), in which one can express Boolean combinations of set constraints and numerical constraints on the cardinalities of sets. Though our new logic is considerably more expressive than ALCQ, we are able to show that the complexity of reasoning in it is the same as in ALCQ, bo

Стилі APA, Harvard, Vancouver, ISO та ін.

Lutz, Carsten, and Maja Miličić. Description Logics with Concrete Domains and Functional Dependencies. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.143.

Повний текст джерела

Анотація:

Description Logics (DLs) with concrete domains are a useful tool in many applications. To further enhance the expressive power of such DLs, it has been proposed to add database-style key constraints. Up to now, however, only uniqueness constraints have been considered in this context, thus neglecting the second fundamental family of key constraints: functional dependencies. In this paper, we consider the basic DL with concrete domains ALC(D), extend it with functional dependencies, and analyze the impact of this extension on the decidability and complexity of reasoning. Though intuitively the

Стилі APA, Harvard, Vancouver, ISO та ін.

Day, William B. Constraints Logic Programming in Knowledge-Based Planning Domains. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada262958.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

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

Стилі APA, Harvard, Vancouver, ISO та ін.

Lutz, Carsten, Carlos Areces, Ian Horrocks, and Ulrike Sattler. Keys, Nominals, and Concrete Domains. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.122.

Повний текст джерела

Анотація:

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to 'concrete' domains such as numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be quite useful for reasoning about conceptual models of information systems, and as the basis for expressive ontology languages. We propose to further extend such DLs with key constraints that allow the expression of statements like 'US citizens are uniquely identified by their social security number'. Based on this idea, we introduce a number

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, and Filippo De Bortoli. The Expressive Power of Description Logics with Numerical Constraints over Restricted Classes of Models (Extended Version). Technische Universität Dresden, 2025. https://doi.org/10.25368/2025.126.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Stefan Borgwardt, and Marcel Lippmann. On the Complexity of Temporal Query Answering. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.191.

Повний текст джерела

Анотація:

Ontology-based data access (OBDA) generalizes query answering in databases towards deduction since (i) the fact base is not assumed to contain complete knowledge (i.e., there is no closed world assumption), and (ii) the interpretation of the predicates occurring in the queries is constrained by axioms of an ontology. OBDA has been investigated in detail for the case where the ontology is expressed by an appropriate Description Logic (DL) and the queries are conjunctive queries. Motivated by situation awareness applications, we investigate an extension of OBDA to the temporal case. As query lan

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, and Alexander Okhotin. Solving Language Equations and Disequations Using Looping Tree Automata with Colors. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.185.

Повний текст джерела

Анотація:

We extend previous results on the complexity of solving language equations with one-sided concatenation and all Boolean operations to the case where also disequations (i.e., negated equations) may occur. To show that solvability of systems of equations and disequations is still in ExpTime, we introduce a new type of automata working on infinite trees, which we call looping automata with colors. As applications of these results, we show new complexity results for disunification in the description logic FL₀ and for monadic set constraints with negation. We believe that looping automata with colo

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!