Academic literature on the topic 'Convex Logical Constraints'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Convex Logical Constraints.'
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 "Convex Logical Constraints"
1
Scala, Enrico, Miquel Ramírez, Patrik Haslum, and Sylvie Thiebaux. "Numeric Planning with Disjunctive Global Constraints via SMT." Proceedings of the International Conference on Automated Planning and Scheduling 26 (March 30, 2016): 276–84. http://dx.doi.org/10.1609/icaps.v26i1.13766.
Full textAbstract:
This paper describes a novel encoding for sequential numeric planning into the problem of determining the satisfiability of a logical theory T. We introduce a novel technique, orthogonal to existing work aiming at producing more succinct encodings that enables the theory solver to roll up an unbounded yet finite number of instances of an action into a single plan step, greatly reducing the horizon at which T models valid plans. The technique is then extended to deal with problems featuring disjunctive global constraints, in which the state space becomes a non-convex n dimensional polytope. In order to empirically evaluate the encoding, we build a planner, SPRINGROLL, around a state–of–the–art off– the–shelf SMT solver. Experiments on a diverse set of domains are finally reported, and results show the generality and efficiency of the approach.
2
Gao, Wei, Hengyi Lv, Qiang Zhang, and Dunbo Cai. "Estimating the Volume of the Solution Space of SMT(LIA) Constraints by a Flat Histogram Method." Algorithms 11, no. 9 (September 18, 2018): 142. http://dx.doi.org/10.3390/a11090142.
Full textAbstract:
The satisfiability modulo theories (SMT) problem is to decide the satisfiability of a logical formula with respect to a given background theory. This work studies the counting version of SMT with respect to linear integer arithmetic (LIA), termed SMT(LIA). Specifically, the purpose of this paper is to count the number of solutions (volume) of a SMT(LIA) formula, which has many important applications and is computationally hard. To solve the counting problem, an approximate method that employs a recent Markov Chain Monte Carlo (MCMC) sampling strategy called “flat histogram” is proposed. Furthermore, two refinement strategies are proposed for the sampling process and result in two algorithms, MCMC-Flat1/2 and MCMC-Flat1/t, respectively. In MCMC-Flat1/t, a pseudo sampling strategy is introduced to evaluate the flatness of histograms. Experimental results show that our MCMC-Flat1/t method can achieve good accuracy on both structured and random instances, and our MCMC-Flat1/2 is scalable for instances of convex bodies with up to 7 variables.
3
Wu, Hsien-Chung. "The optimality conditions for optimization problems with convex constraints and multiple fuzzy-valued objective functions." Fuzzy Optimization and Decision Making 8, no. 3 (June 9, 2009): 295–321. http://dx.doi.org/10.1007/s10700-009-9061-6.
Full text
4
Liao, Jiagen, and Zhongping Wan. "Inexact Restoration Methods for Semivectorial Bilevel Programming Problem on Riemannian Manifolds." Axioms 11, no. 12 (December 5, 2022): 696. http://dx.doi.org/10.3390/axioms11120696.
Full textAbstract:
For a better understanding of the bilevel programming on Riemannian manifolds, a semivectorial bilevel programming scheme is proposed in this paper. The semivectorial bilevel programming is firstly transformed into a single-level programming problem by using the Karush–Kuhn–Tucker (KKT) conditions of the lower-level problem, which is convex and satisfies the Slater constraint qualification. Then, the single-level programming is divided into two stages: restoration and minimization, based on which an Inexact Restoration algorithm is developed. Under certain conditions, the stability and convergence of the algorithm are analyzed.
5
Zhu, Xinyue, Wei Li, and Xueping Luo. "Stability for a Class of Differential Set-Valued Inverse Variational Inequalities in Finite Dimensional Spaces." Axioms 11, no. 9 (September 16, 2022): 475. http://dx.doi.org/10.3390/axioms11090475.
Full textAbstract:
In this paper, we introduce and study a new class of differential set-valued inverse variational inequalities in finite dimensional spaces. By applying a result on differential inclusions involving an upper semicontinuous set-valued mapping with closed convex values, we first prove the existence of Carathéodory weak solutions for differential set-valued inverse variational inequalities. Then, by the existence result, we establish the stability for the differential set-valued inverse variational inequality problem when the constraint set and the mapping are perturbed by two different parameters. The closedness and continuity of Carathéodory weak solutions with respect to the two different parameters are obtained.
6
Lee, Eun-Ji, and Jae-Hwan Jhong. "Change Point Detection Using Penalized Multidegree Splines." Axioms 10, no. 4 (December 1, 2021): 331. http://dx.doi.org/10.3390/axioms10040331.
Full textAbstract:
We consider a function estimation method with change point detection using truncated power spline basis and elastic-net-type L1-norm penalty. The L1-norm penalty controls the jump detection and smoothness depending on the value of the parameter. In terms of the proposed estimators, we introduce two computational algorithms for the Lagrangian dual problem (coordinate descent algorithm) and constrained convex optimization problem (an algorithm based on quadratic programming). Subsequently, we investigate the relationship between the two algorithms and compare them. Using both simulation and real data analysis, numerical studies are conducted to validate the performance of the proposed method.
7
Rizzo, Nicola, and Agostino Dovier. "3coSoKu and its declarative modeling." Journal of Logic and Computation 32, no. 2 (January 18, 2022): 307–30. http://dx.doi.org/10.1093/logcom/exab086.
Full textAbstract:
Abstract In this paper, we analyze the physical puzzle IcoSoKu, a game about placing some given triangular tiles on the faces of an icosahedron in order to fill the capacities of its vertices, and we propose its generalization called 3coSoKu, admitting an arbitrary playing field with triangular faces, arbitrary capacities and an arbitrary set of triangular tiles. First, we prove the strong NP-completeness of 3coSoKu, even when the playing field is a convex polyhedron with equilateral triangles as faces. Second, we encode 3coSoKu both in the constraint modeling language MiniZinc and in the logic programming paradigm known as Answer Set Programming and we develop a visual tool for an accessible interface to the solver. Finally, we use our encodings to verify experimentally that every initial state for IcoSoKu admits a solution.
8
Stetsyuk, Petro, Oleksii Lykhovyd, Volodymyr Zhydkov, and Anton Suprun. "OPTIMIZATION PROBLEMS OF MODERNIZATION OF THE CAPACITY OF ARCS OF FAULT-TOLERANT NETWORKS." Journal of Automation and Information sciences 5 (September 1, 2021): 5–20. http://dx.doi.org/10.34229/1028-0979-2021-5-1.
Full textAbstract:
Mathematical models of two classes of problems of modernization of the capacity of arcs of fault-tolerant oriented networks are considered. A network is considered to be fault-tolerant for which it is possible to satisfy all the demands for the transmission of flows when there will be one, but any failure, from all possible single network failures. For the first class of problems (problem A), all possible paths in the network can be used for the transmission of flows. For the second class of problems (problem P), only paths from a predetermined set of paths are used to transfer flows. Mathematical models are represented by linear, Boolean and nonlinear programming problems with a block structure of the constraint matrix.The material of the article is presented in five sections. The first section describes the concepts of a single failure and the scenario of network failures, the content of optimization problems A and P for modernization of capacity of arcs of a fault-tolerant network, a test network (6 vertices and 19 arcs) to test algorithms for solving the problems of modernization of fault-tolerant networks. In the second section, basic models of linear programming problems for finding the capacities of arcs of the fault-tolerant physical structure of a network (problem A) and the fault-tolerant logical structure of a network (problem P) are described, and their properties are considered. The third section describes problems A and P in the form of mixed Boolean linear programming models. Optimal solutions of problem A for various failure scenarios are given for the example of the test network. The solutions were found using the Gurobi program from the NEOS server, where the mathematical model of problem A is described in the AMPL modeling language.The fourth section describes nonlinear convex programming models for problems A and P, developed to find the optimal capacities of fault-tolerant networks according to the selected criterion, and a decomposition algorithm for their solution. The fifth section describes software in the FORTRAN programming language for the decomposition algorithm based on efficient implementations of Shor’s r-algorithms. The decomposition algorithm is compared with the IPOPT program based on the results of solving test problems.
9
Perminov, E. A., D. D. Gadjiev, and M. M. Abdurazakov. "About relevance of fundamentalisation of mathematical training of students of the pedagogical directions during the digital era." Education and science journal 21, no. 5 (May 31, 2019): 86–111. http://dx.doi.org/10.17853/1994-5639-2019-5-87-112.
Full textAbstract:
Introduction. The era of post-industrial society of knowledge differs from the previous socio-economic period in many important aspects: total digitalisation, automation and robotisation, and furthermore, cross-disciplinary integration of various scientific fields, among which mathematics is of particular relevance. Over the last decades, the language, tools and methods of the digital era have emerged as the basic universal research tools in physics, biology, chemistry, and engineering, organisation of production and in many other theoretical and applied spheres of activity. Against the background of progressively advanced mathematisation, which covers larger functional intellectual space, it is extremely important to provide the fundamental, advancing nature of mathematical training of students, including in the first place the students of the pedagogical directions. The graduates of pedagogical higher education institutions will have not only to convey certain academic educational information, but to coordinate educational trajectories according to a training maxim in their lifetime that is hardly possible without understanding of basic mathematics.The aim of the present publication is to discuss methodological, culturological and didactic aspects of mathematical training of students of the pedagogical directions.Methodology and research methods. In the course of the work, the authors used the provisions and requirements of the new Federal State Educational Standards (FSES). The psychological and pedagogical framework of the research is based on the concepts of developing learning and upbringing, vocational and pedagogical orientation of training of future teachers and the idea of lifelong education. The analytical review and synthesis of the content of philosophical, mathematical, pedagogical, methodological literature and normative documents was conducted. The state of mathematical components of pedagogical education and its ways of fundamentalisation were considered according to the theory of training, comparative, culturological and system-based types of analysis.Results and scientific novelty. The authors note the imbalance between the fundamental mathematical preparation, which is relevant for a modern person, and the competency-based approach, which currently dominates in education and constraints to students’ holistic understanding of mathematical area of knowledge, even within the boundaries of a particular discipline. The situation is exacerbated by an avalanche distribution of information technologies. One of the negative consequences of this situation is replacement of meaningful learning of mathematics with “coaching” of school students and university students for formal test performance. To address these challenges, culturological educational models, which form common cultural ideas of modern mathematics according to the principle of a cultural conformity, have to be the predominant in education, but not competency-based attitudes focused on narrow specialisation. Mathematical modelling, discrete mathematics and computation processes are identified as the most significant components of a new stage of universal mathematical culture evolution. As a result of a digital era, general-education concepts have already become the key concepts of various sections of mathematics, therefore, it is necessary to start a general introduction to the study of these concepts at the stages of school education.It is highlighted that fundamentalisation of mathematical preparation plays the leading role in the development of logical and professional innovative thinking of students through the understanding of multifunctional structures and schemes (as means and knowledge methods) similar to mathematical structures and schemes. It is appropriately useful to include special courses into a variable part of the master’s programmes (according to education directions), implying students’ research activities: “Mathematical Modelling in Professional Education”, “Bases of Modern Mathematical Culture”, “Discrete Mathematics”, “Mathematical Bases of the System Analysis”, etc.The authors are convinced that the introduction of the concept of mathematical preparation, based on the culturological and system-based approaches, will help to resolve an apparent contradiction between, on the one hand, the necessary integration and fundamentalisation of knowledge acquired by students, and, on the other hand, the disciplinary dissociations of educational material, shortcomings of competency-based training and formal use of information technologies.Practical significance. The materials of the publication can be useful for future and practicing teachers of mathematics, computer science and related academic disciplines. Moreover, the present publication can be used by education professionals interested in improving the education quality.
10
Kumar, T. K. Satish, Duc Thien Nguyen, William Yeoh, and Sven Koenig. "A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 28, no. 1 (June 21, 2014). http://dx.doi.org/10.1609/aaai.v28i1.9043.
Full textAbstract:
In this paper, we describe a simple randomized algorithm that runs in polynomial time and solves connected row convex (CRC) constraints in distributed settings. CRC constraints generalize many known tractable classes of constraints like 2-SAT and implicational constraints. They can model problems in many domains including temporal reasoning and geometric reasoning, and generally speaking, play the role of ``Gaussians'' in the logical world. Our simple randomized algorithm for solving them in distributed settings, therefore, has a number of important applications. We support our claims through a theoretical analysis and empirical results.
Dissertations / Theses on the topic "Convex Logical Constraints"
1
Giannini, Francesco. "On the Integration of Logic and Learning." Doctoral thesis, Università di Siena, 2019. http://hdl.handle.net/11365/1072603.
Full textAbstract:
A key point in the success of machine learning, and in particular deep learning, has been the availability of high-performance computing architectures allowing to process a large amount of data. However, this potentially prevents a wider application of machine learning in real world applications, where the
collection of training data is often a slow and expensive process, requiring an extensive human intervention. This suggests to look at possible ways to overcome this limitation, for instance injecting prior knowledge into a learning problem to express some desired behaviors for the functions to be learned.
In this thesis, we consider the case of prior knowledge expressed by means of first-order logic formulas to be integrated into a learning problem. In particular, at first the formulas are converted into real-valued functions by means of t-norm fuzzy logic operators. Thereafter, a loss component (a constraint) is assigned to any function representing a formula and all these components are aggregated (e.g. summed) together with other possible loss components, e.g. a regularization term or some loss components associated to supervisions, if they are available for the functions to be learned. Both the functional representation of a formula and the mapping into a loss component have been investigated, and some theoretical results are discussed to get an insight on how to bring some benefits for different learning schemata. In particular we
define a fragment of Lukasiewicz logic that guarantees to yield convex functional constraints given any knowledge base made of first-order logic formulas. The convexity of these constraints is exploited to formulate collective classification as a quadratic optimization problem and some experimental results are discussed. In addition, we extend classic Support Vector Machines with logical constraints, still preserving quadratic programming resolution. Since formulas may be logically depending on each other, some of the constraints may turn out to be unnecessary with respect to the learning process. This suggests to generalize the notion of support vector to support constraint, and we provide both logical and algebraic criteria to determine the constraints that are unnecessary. Finally we present LYRICS, a general interface implemented in TensorFlow to integrate both deep learning architectures and a first-order logic representation of knowledge for a learning problem. In particular, we show several learning tasks that may be addressed in LYRICS, with a special discussion for the case of visual generation.
Books on the topic "Convex Logical Constraints"
1
Golan, Amos. Causal Inference via Constraint Satisfaction. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199349524.003.0011.
Full textAbstract:
In this chapter I introduce a number of ideas connected to causal inference that are inherently connected to info-metrics. In the context of this chapter, causal inference means the causality inferred from the available information. I begin by introducing and examining nonmonotonic and default logics, which were developed to deal with extremely high conditional probabilities. Other facets of info-metrics and causal inference are then discussed. I also show the direct effect of the complete set of input information on the inferred solution. I conclude the chapter with a detailed Markov example providing a more traditional approach to causal inference, developed within the info-metrics framework. The example builds on the notion of exogeneity and demonstrates that the info-metrics framework provides a simple way of incorporating additional exogenous information, thereby opening the way for empirical testing of causal inference. A short summary of the notion of “pure” causality is also provided.
2
Sanders, Rebecca. Plausible Legality. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190870553.001.0001.
Full textAbstract:
After 9/11, American officials authorized numerous contentious counterterrorism practices including torture, extraordinary rendition, indefinite detention, trial by military commission, targeted killing, and mass surveillance. While these policies sparked global outrage, the Bush administration defended them as legally legitimate. Government lawyers produced memoranda deeming enhanced interrogation techniques, denial of habeas corpus, drone strikes, and warrantless wiretapping lawful. Although it rejected torture, the Obama administration made similar claims and declined to prosecute abuses. This book seeks to understand how and why Americans repeatedly legally justified seemingly illegal security policies and what this tells us about the capacity of law to constrain state violence. It argues that legal cultures shape how political actors interpret, enact, and evade legal norms. In the global war on terror, a culture of legal rationalization encouraged authorities to seek legal cover—to construct the plausible legality of human rights violations—in order to ensure impunity for wrongdoing. In this context, law served as a permissive constraint, enabling abuses while imposing some limits on what could be plausibly legalized. Cultures of legal rationalization stand in contrast with other cultures prevalent in American history, including cultures of exception, which rely on logics of necessity and racial exclusion, and cultures of secrecy, which employ plausible deniability. Looking forward, legal norms remain vulnerable to manipulation and evasion. Despite the efforts of human rights advocates to encourage deeper compliance, the normalization of post-9/11 policy has created space for the Trump administration to promote a renewed culture of exception and launch bolder attacks on the rule of law.
3
Lassiter, Daniel. Implications for the epistemic auxiliaries. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198701347.003.0006.
Full textAbstract:
The semantics of the adjectives places strong constraints on theories of the better-studied epistemic auxiliaries. This chapter motivates some basic connections – for instance, must asymmetrically entails likely; likely asymmetrically entails might and possible; and certain asymmetrically entails must (modulo the evidential presupposition of the latter). In addition, I present a lottery experiment showing that might has a context-sensitive meaning that is stronger than possible’s. These connections suffice to rule out the classical treatment from modal logic, as revived recently by von Fintel & Gillies (2010). It also rules out Kratzer’s (1991) theory. The probabilistic theory of Swanson (2006); Lassiter (2011, 2016) satisfies our desiderata, though, as does Swanson’s (2015) blend of the scalar semantics with Kratzer’s account. Both have access to a plausible formalization of must’s evidential component, but the latter has additional interesting features – both strengths and weaknesses – involving dualities and the treatment of so-called “epistemic ought”.
4
Stojnić, Una. Context and Coherence. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198865469.001.0001.
Full textAbstract:
Natural languages are riddled with context-sensitivity. One and the same string of words can express indefinitely many different meanings on an occasion of use. And yet we understand one another effortlessly, on the fly. What fixes the meaning of context-sensitive expressions, and how are we able to recover this meaning so quickly and without effort? This book offers a novel response: we can do so because we draw on a broad array of subtle linguistic conventions that fully determine the interpretation of context-sensitive items. Contrary to the dominant tradition, which maintains that the meaning of context-sensitive language is underspecified by grammar, and depends on non-linguistic features of utterance situation, this book argues that meaning is determined entirely by discourse conventions, rules of language that have largely been missed, and the effects of which have been mistaken for extra-linguistic effects of an utterance situation on meaning. The linguistic account of context developed in this book sheds a new light on the nature of linguistic content, and the interaction between content and context. At the same time, it provides a novel model of context that should constrain and help evaluate debates across many sub-fields of philosophy where appeal to context has been common, often leading to surprising conclusions: for example, in epistemology, ethics, value theory, metaphysics, metaethics, and logic, among others.
Book chapters on the topic "Convex Logical Constraints"
1
Hughes, Jack, and Dominic Orchard. "Resourceful Program Synthesis from Graded Linear Types." In Logic-Based Program Synthesis and Transformation, 151–70. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68446-4_8.
Full textAbstract:
AbstractLinear types provide a way to constrain programs by specifying that some values must be used exactly once. Recent work on graded modal types augments and refines this notion, enabling fine-grained, quantitative specification of data use in programs. The information provided by graded modal types appears to be useful for type-directed program synthesis, where these additional constraints can be used to prune the search space of candidate programs. We explore one of the major implementation challenges of a synthesis algorithm in this setting: how does the synthesis algorithm efficiently ensure that resource constraints are satisfied throughout program generation? We provide two solutions to this resource management problem, adapting Hodas and Miller’s input-output model of linear context management to a graded modal linear type theory. We evaluate the performance of both approaches via their implementation as a program synthesis tool for the programming language Granule, which provides linear and graded modal typing.
2
Kreutzer, Stephan. "Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls." In Database Theory — ICDT 2001, 248–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44503-x_17.
Full text
3
Usman, Muhammad, Divya Gopinath, Youcheng Sun, Yannic Noller, and Corina S. Păsăreanu. "NNrepair: Constraint-Based Repair of Neural Network Classifiers." In Computer Aided Verification, 3–25. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_1.
Full textAbstract:
AbstractWe present NNrepair, a constraint-based technique for repairing neural network classifiers. The technique aims to fix the logic of the network at an intermediate layer or at the last layer. NNrepair first uses fault localization to find potentially faulty network parameters (such as the weights) and then performs repair using constraint solving to apply small modifications to the parameters to remedy the defects. We present novel strategies to enable precise yet efficient repair such as inferring correctness specifications to act as oracles for intermediate layer repair, and generation of experts for each class. We demonstrate the technique in the context of three different scenarios: (1) Improving the overall accuracy of a model, (2) Fixing security vulnerabilities caused by poisoning of training data and (3) Improving the robustness of the network against adversarial attacks. Our evaluation on MNIST and CIFAR-10 models shows that NNrepair can improve the accuracy by 45.56% points on poisoned data and 10.40% points on adversarial data. NNrepair also provides small improvement in the overall accuracy of models, without requiring new data or re-training.
4
Al-Jumaily, Harith T., Dolores Cuadra, and Paloma Martínez. "MDD Approach for Maintaining Integrity Constraints in Databases." In Handbook of Research on Innovations in Database Technologies and Applications, 145–53. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-242-8.ch017.
Full textAbstract:
In the context of database, we believe that MDD (Model-Driven Development) (OMG, 2006) is a very ambitious task because we find that when applying database development methodologies such as (Elmasri, et al., 2007), there are processes devoted to transforming conceptual into logical schemata. In such processes, semantic losses are produced since logical elements are not coincident with conceptual elements. A correct constraints transformation is necessary to preserve the semantics that reflects the Universe of Discourse. The multiplicity constraint, also called cardinality constraint, is one of these constraints that can be established in a conceptual schema. It has dynamic aspects that are transformed into the logical model as certain conditions to verify the insertion, deletion, and update operations. The verification of these constraints is a serious and complex problem because currently database systems are not able to preserve the multiplicity constraints of their objects. To solve the modeling problem, CASE tools have been introduced to automate the life cycle of database development. These platforms try to help the database developers in different design phases. Nevertheless, these tools are frequently simple graphical interfaces and do not completely carryout the design methodology that they are should to support.
5
Stojnić, Una. "Pointing Things Out: Prominence and the Attentional State of a Discourse." In Context and Coherence, 40–57. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198865469.003.0004.
Full textAbstract:
This chapter provides the key elements of the account of context and context-sensitivity. Like the shifty, dynamic account of context in Chapter 3, this account models context as a running record of candidate interpretations for context-sensitive items, for exmaple, demonstrative pronouns. However, by contrast, the chapter argues that context organizes candidate interpretations by prominence. Further, it argues that prominence is fully linguistically determined: the context is updated exclusively by linguistic rules, through effects triggered by elements in the logical form of a discourse. These elements are richer than standardly thought, including, for example, contributions of demonstrative gestures. A demonstrative, then, receives a simple unambiguous meaning: as a matter of its meaning, it simply selects the most prominent interpretation that satisfies its lexically encoded constraints. This account is argued to be empirically more adequate, and avoids the theoretical challenges facing the alternatives discussed in earlier chapters.
6
Pace, Gordon J. "A General Theory of Contract Conflicts with Environmental Constraints." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2020. http://dx.doi.org/10.3233/faia200852.
Full textAbstract:
One advantage of using formal deontic logic to represent and reason about normative texts is that one can analyse such texts in a precise and incontrovertible manner. Conflict analysis is one such analysis technique — assessing whether a number of contracts, or more generally normative texts, are internally consistent, in that they may not lead to a situation in which active norms conflict or even contradict each other. In this paper we extend existing techniques from the literature to address conflicts in the context of environmental constraints on actions regulated by the contract, and which the parties involved can carry out. The approach is logic-agnostic and we show how it can be applied to a service provision contract written in 𝒞ℒ.
7
Misra, Janardan. "Towards a Framework for Collaborative Enterprise Security." In Threats, Countermeasures, and Advances in Applied Information Security, 309–34. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0978-5.ch016.
Full textAbstract:
The role of human behaviour in enterprise security is one of the little studied aspects. The author proposes a reinforcement model of collaborative security employing basic concepts from game theory, socio-psychology, and probabilistic model-checking. The proposed model aims towards solving the problem of inducing positive network effect to enable user centric monitoring of security violations, in particular, against violations related to ”semantic manipulation” of context dependent logical resources. Preventing such violations using existing security enforcement mechanisms is neither feasible nor cost effective. The author defines a payoff mechanism to formalize the model by stipulating appropriate payoffs as reward, punishment, and community price according to reporting of genuine or false violations, non-reporting of the detected violations, and proactive reporting of vulnerabilities and threats by the users. Correctness properties of the model are defined in terms of probabilistic robustness property and constraints for economic feasibility of the payoffs. For estimating the payoff parameters, system and user behaviours are further modelled in terms of probabilistic finite state machines (PFSM) and likelihood of the success of the model is specified using probabilistic computation tree logic (PCTL). PRISM model checker based automated quantitative analysis elicits the process of the estimation of various parameters in the model using PFSMs and PCTL formulas.
8
Bock, Gregory A., Ryan T. Hendrickson, Jared Allen Lamkin, Brittany Dhall, Jing Wang, and In Soo Ahn. "Experimental Validation of Distributed Cooperative Control of Multiple Mobile Robots via Local Information Exchange." In Robotic Systems, 743–64. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1754-3.ch039.
Full textAbstract:
In this paper, we present the experimental testing results of distributed cooperative control algorithms for multiple mobile robots with limited sensing/communication capacity and kinematic constraints. Rendezvous and formation control problems are considered, respectively. To deal with the inherent kinematic constraints with robot model, the input/output linearization via feedback is used to convert the nonlinear robot model into a linear one, and then the distributed cooperative control algorithms are designed via local information exchange among robots. Extensive experiments using Quanser's QBot2 mobile robot platforms are conducted to validate the effectiveness of the proposed distributed cooperative control algorithms. Specifically, the robot's onboard Kinect vision sensor is applied to solve the localization problem, and the information exchange is done through an ad-hoc peer-to-peer wireless TCP/IP connection among neighboring robots. Collision avoidance problem is also addressed based on the utilization of fuzzy logic rules.
9
Moffitt, Michael. "CommentsMachiavelli and the Bar and Ethical Ratcheting." In Discussions in Dispute Resolution, 31–35. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780197513248.003.0007.
Full textAbstract:
At the time of its publication, J.J. White’s essay, Machiavelli and the Bar, contributed a timely perspective on the challenges of drafting ethical constraints on negotiators’ behaviors. With this brief response, I first situate the essay historically, suggesting that Machiavelli and the Bar could not have been written two decades earlier, nor would it have had much impact had it been written two decades later. Second, I highlight some of the ambivalence apparent in Professor White’s analysis. Finally, I raise a concern about where White’s logic would take (has taken?) the legal profession with respect to the important question of ethical norm-setting in the context of negotiations....
10
Vaz, Maria Salete Marcon Gomes, and Lucélia de Souza. "Conventional and Non-Conventional Data Modeling." In Enterprise Business Modeling, Optimization Techniques, and Flexible Information Systems, 141–58. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-3946-1.ch011.
Full textAbstract:
The modeling of database applications involves deciding on how to represent the project in real-world objects. The data modeling process corresponds to a set of conceptual tools to describe data, its relationships, its semantics, and constraints of consistency. This process involves the steps related to the identification of requisites, conceptual modeling of data, conventional modeling, and non-conventional modeling of objects, and its relationships. In the conceptual modeling, where there is no need to specify the methods and data flow, objects and their relationships are defined. In conventional modeling, in the mapping of the conceptual model (Entity/Relationship) to the logical model (Relational) conversion rules are applied. However, there are non-conventional resources with the ability to create and use data types based on a grouping of other data types. The user-defined objects can be defined and used like any other data type. This chapter describes the process of mapping the relational model for the object-relational modeling, using a practical application in agricultural context, but it should be noted that the methodology is applicable to any area of knowledge.
Conference papers on the topic "Convex Logical Constraints"
1
Kumar, T. K. Satish, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, and Craig A. Knoblock. "A Distributed Logical Filter for Connected Row Convex Constraints." In 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2017. http://dx.doi.org/10.1109/ictai.2017.00026.
Full text
2
Suilen, Marnix, Nils Jansen, Murat Cubuktepe, and Ufuk Topcu. "Robust Policy Synthesis for Uncertain POMDPs via Convex Optimization." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/569.
Full textAbstract:
We study the problem of policy synthesis for uncertain partially observable Markov decision processes (uPOMDPs). The transition probability function of uPOMDPs is only known to belong to a so-called uncertainty set, for instance in the form of probability intervals. Such a model arises when, for example, an agent operates under information limitation due to imperfect knowledge about the accuracy of its sensors. The goal is to compute a policy for the agent that is robust against all possible probability distributions within the uncertainty set. In particular, we are interested in a policy that robustly ensures the satisfaction of temporal logic and expected reward specifications. We state the underlying optimization problem as a semi-infinite quadratically-constrained quadratic program (QCQP), which has finitely many variables and infinitely many constraints. Since QCQPs are non-convex in general and practically infeasible to solve, we resort to the so-called convex-concave procedure to convexify the QCQP. Even though convex, the resulting optimization problem still has infinitely many constraints and is NP-hard. For uncertainty sets that form convex polytopes, we provide a transformation of the problem to a convex QCQP with finitely many constraints. We demonstrate the feasibility of our approach by means of several case studies that highlight typical bottlenecks for our problem. In particular, we show that we are able to solve benchmarks with hundreds of thousands of states, hundreds of different observations, and we investigate the effect of different levels of uncertainty in the models.
3
Das, Atish K., and Noshir A. Langrana. "Geometry Reconstruction of Vectorized Drawings Consisting of Orthographic Views." In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/cie-1655.
Full textAbstract:
Abstract The benefits of the existing CAD systems are not available to a large number of engineering drawings which were created on paper using conventional drafting methods. There is a need for an automated system which will convert the scanned images of these drawings into a format recognizable by a CAD system. One of the main components of such a system is the vectorization (raster-to-vector) system which converts the binary image of the scanned drawing into a set of straight line segments, arcs, and circles. The accuracy of the vectorized output in terms of the location and size of the various entities is very important if it is to be used for further processing. This paper describes a system which rectifies errors in the vectorized output using a constraint-based approach based on the principles of variational geometry. The system considers drawings consisting of three orthographic views. The dimension sets present in the drawing and the logical relationship existing between the views are recognized and interpreted to obtain a set constraints governing the geometry of the object. The set of constraint equations are then numerically solved to obtain the exact coordinates of the points used to describe the geometry.
4
Liu, Yilun, Lei Zuo, and Xiudong Tang. "Regenerative Vibration Control of Tall Buildings Using Model Predictive Control." In ASME 2013 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/dscc2013-3988.
Full textAbstract:
The regenerative Tuned Mass Damper (TMD) can convert the vibration energy of the tall building into the electricity, by replacing the damping element with electromagnetic harvester. The energy harvesting circuit therein which can regulate the electricity and control the vibration will introduce some constraints when designing vibration controller. This paper designed the vibration controller based on Model Predictive Control (MPC). The control force constraints were taken into consideration before designing the controller. The building model with semi-active constraints due to the regenerative properties of the TMD is converted into a Mixed Logical Dynamical (MLD) system first. Then the optimal controller is designed by solving the Mixed Integer Quadratic Programming (MIQP) problem. The results were evaluated and compared to the ones using “clipped-optimal” controller with the same constraints. It is found that the MPC controller can provide the same or better vibration control Results depending on the predicted horizon. Besides, an explicit MPC is obtained to reduce the online computation effort.
5
Atia, George, Andre Beckus, Ismail Alkhouri, and Alvaro Velasquez. "Steady-State Policy Synthesis in Multichain Markov Decision Processes." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/563.
Full textAbstract:
The formal synthesis of automated or autonomous agents has elicited strong interest from the artificial intelligence community in recent years. This problem space broadly entails the derivation of decision-making policies for agents acting in an environment such that a formal specification of behavior is satisfied. Popular formalisms for such specifications include the quintessential Linear Temporal Logic (LTL) and Computation Tree Logic (CTL) which reason over infinite sequences and trees, respectively, of states. However, the related and relevant problem of reasoning over the frequency with which states are visited infinitely and enforcing behavioral specifications on the same has received little attention. That problem, known as Steady-State Policy Synthesis (SSPS) or steady-state control, is the focus of this paper. Prior related work has been mostly confined to unichain Markov Decision Processes (MDPs), while a tractable solution to the general multichain setting heretofore remains elusive. In this paper, we provide a solution to the latter within the context of multichain MDPs over a class of policies that account for all possible transitions in the given MDP. The solution policy is derived from a novel linear program (LP) that encodes constraints on the limiting distributions of the Markov chain induced by said policy. We establish a one-to-one correspondence between the feasible solutions of the LP and the stationary distributions of the induced Markov chains. The derived policy is shown to maximize the reward among the constrained class of stationary policies and to satisfy the specification constraints even when it does not exercise all possible transitions.
6
Ozawa, Masanori, Yumi Iwasaki, and Mark R. Cutkosky. "Multi Disciplinary Early Performance Evaluation via Logical Description of Mechanisms: DVD Pick up Head Example." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/cie-6007.
Full textAbstract:
Abstract This paper describes an approach developed to support the early stages of designing multidisciplinary products. In the design of such products it is important for various specialists to share representations of the engineering models they use in making trade-off studies. Sharing information among diverse engineering tools at the data level is notoriously difficult and inflexible. When any of the modeling details, assumptions or constraints change, the translation must usually be rewritten. Our solution to this problem is to formalize the exchange of information among engineering specialists and their tools as a problem in communication among agents. The agents share a common ontology and a compositional modeling language (CML) in which models can be created such that conventions, constraints, and assumptions are defined formally and ultimately grounded in logic. We have applied CML in the context of a pick-up head design problem for DVD (digital versatile disc / digital video disc) players. We describe the pick-up head design problem, the CML models we have created to address early stages of pick-up head design, and the use of the CML models by a team of specialists, each participating as an agent in a concurrent engineering exercise.
7
Carr, Steven, Nils Jansen, and Ufuk Topcu. "Verifiable RNN-Based Policies for POMDPs Under Temporal Logic Constraints." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/570.
Full textAbstract:
Recurrent neural networks (RNNs) have emerged as an effective representation of control policies in sequential decision-making problems. However, a major drawback in the application of RNN-based policies is the difficulty in providing formal guarantees on the satisfaction of behavioral specifications, e.g. safety and/or reachability. By integrating techniques from formal methods and machine learning, we propose an approach to automatically extract a finite-state controller (FSC) from an RNN, which, when composed with a finite-state system model, is amenable to existing formal verification tools. Specifically, we introduce an iterative modification to the so-called quantized bottleneck insertion technique to create an FSC as a randomized policy with memory. For the cases in which the resulting FSC fails to satisfy the specification, verification generates diagnostic information. We utilize this information to either adjust the amount of memory in the extracted FSC or perform focused retraining of the RNN. While generally applicable, we detail the resulting iterative procedure in the context of policy synthesis for partially observable Markov decision processes (POMDPs), which is known to be notoriously hard. The numerical experiments show that the proposed approach outperforms traditional POMDP synthesis methods by 3 orders of magnitude within 2% of optimal benchmark values.
8
Křetínský, Jan. "LTL-Constrained Steady-State Policy Synthesis." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/565.
Full textAbstract:
Decision-making policies for agents are often synthesized with the constraint that a formal specification of behaviour is satisfied. Here we focus on infinite-horizon properties. On the one hand, Linear Temporal Logic (LTL) is a popular example of a formalism for qualitative specifications. On the other hand, Steady-State Policy Synthesis (SSPS) has recently received considerable attention as it provides a more quantitative and more behavioural perspective on specifications, in terms of the frequency with which states are visited. Finally, rewards provide a classic framework for quantitative properties. In this paper, we study Markov decision processes (MDP) with the specification combining all these three types. The derived policy maximizes the reward among all policies ensuring the LTL specification with the given probability and adhering to the steady-state constraints. To this end, we provide a unified solution reducing the multi-type specification to a multi-dimensional long-run average reward. This is enabled by Limit-Deterministic Büchi Automata (LDBA), recently studied in the context of LTL model checking on MDP, and allows for an elegant solution through a simple linear programme. The algorithm also extends to the general omega-regular properties and runs in time polynomial in the sizes of the MDP as well as the LDBA.
9
Kerarmi, Abdelouadoud, Assia Kamal-idrissi, and Amal El Fallah Seghrouchni. "An Optimized Fuzzy Logic Model for Proactive Maintenance." In 12th International Conference on Artificial Intelligence, Soft Computing and Applications. Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.122303.
Full textAbstract:
Fuzzy logic has been proposed in previous studies for machine diagnosis, to overcome different drawbacks of the traditional diagnostic approaches used. Among these approaches Failure Mode and Effect Critical Analysis method(FMECA) attempts to identify potential modes and treat failures before they occur based on subjective expert judgments. Although several versions of fuzzy logic are used to improve FMECA or to replace it, since it is an extremely costintensive approach in terms of failure modes because it evaluates each one of them separately, these propositions have not explicitly focused on the combinatorial complexity nor justified the choice of membership functions in Fuzzy logic modeling. Within this context, we develop an optimization-based approach referred to Integrated Truth Table and Fuzzy Logic Model (ITTFLM) thats martly generates fuzzy logic rules using Truth Tables. The ITTFLM was tested on fan data collected in real-time from a plant machine. In the experiment, three types of membership functions (Triangular, Trapezoidal, and Gaussian) were used. The ITTFLM can generate outputs in 5ms, the results demonstrate that this model based on the Trapezoidal membership functions identifies the failure states with high accuracy, and its capability of dealing with large numbers of rules and thus meets the real-time constraints that usually impact user experience.
10
Amirian, Mohammad Mahdi, and Saeed Shiry Ghidary. "Xeggora: Exploiting Immune-to-Evidence Symmetries with Full Aggregation in Statistical Relational Models (Extended Abstract)." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/697.
Full textAbstract:
We present improvements in maximum a-posteriori inference for Markov Logic, a widely used SRL formalism. Several approaches, including Cutting Plane Aggregation (CPA), perform inference through translation to Integer Linear Programs. Aggregation exploits context-specific symmetries independently of evidence and reduces the size of the program. We illustrate much more symmetries occurring in long ground clauses that are ignored by CPA and can be exploited by higher-order aggregations. We propose Full-Constraint-Aggregation, a superior algorithm to CPA which exploits the ignored symmetries via a lifted translation method and some constraint relaxations. RDBMS and heuristic techniques are involved to improve the overall performance. We introduce Xeggora as an evolutionary extension of RockIt, the query engine that uses CPA. Xeggora evaluation on real-world benchmarks shows progress in efficiency compared to RockIt especially for models with long formulas.
Reports on the topic "Convex Logical Constraints"
1
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.
Full textAbstract:
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 expressivity of functional dependencies seems weaker than that of uniqueness constraints, we are able to show that the former have a similarly severe impact on the computational properties: reasoning is undecidable in the general case, and NExpTime-complete in some slightly restricted variants of our logic.