The main goal of this thesis was to study common technologies using in an iOS development and then to get familiar with application programming interfaces on practice. This work was logically split into theory and imp...
The main goal of this thesis was to study common technologies using in an iOS development and then to get familiar with application programming interfaces on practice. This work was logically split into theory and implementation parts. Each part allowed taking a look on application development issues from different points of view. The theory part of this work covered core classes of the UIKit framework such as UIView, UIViewController and UITableViewController. Also, view geometry and coordinate system were explained in order to go deeper into more hardware related lower abstract levels from higher abstract software-related UIKit framework. In conclusion of the theory part, application programming interfaces used in implementation part were covered. As for implementation part, the main idea was to go partly throuth the life cycle of a mobile app development, while developing the practice project. This cycle included app prototyping, designing UI, designing an app’s logic, etc. The practice project was map- based iOS application called FindSpot. The FindSpot app was designed to help people to search and share places in the nature for outdoor activities. As a result, the map-based iOS app prototype was created. During the development process, huge amount of experience in programming, user interface design and software design was received.
This special issue of theory and practice of logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd International Conference on logicprogramming (ICLP 2017), held in Melbourne, Aus...
详细信息
This special issue of theory and practice of logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd International Conference on logicprogramming (ICLP 2017), held in Melbourne, Australia from the 28th of August to the 1st of September, 2017. ICLP 2017 was colocated with the 23rd International Conference on Principles and practice of Constraint programming (CP 2017) and the 20th International Conference on theory and Applications of Satisfiability Testing (SAT 2017). Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logicprogramming.
The pi-calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency. In this paper we propose a new type system for deadlockfree session-type...
详细信息
ISBN:
(纸本)9783319893662;9783319893655
The pi-calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency. In this paper we propose a new type system for deadlockfree session-typed pi-calculus processes, by integrating two separate lines of work. The first is the propositions-as-types approach by Caires and Pfenning, which provides a linear logic foundation for session types and guarantees deadlock-freedom by forbidding cyclic process connections. The second is Kobayashi's approach in which types are annotated with priorities so that the type system can check whether or not processes contain genuine cyclic dependencies between communication operations. We combine these two techniques for the first time, and define a new and more expressive variant of classical linear logic with a proof assignment that gives a session type system with Kobayashi-style priorities. This can be seen in three ways: (i) as a new linear logic in which cyclic structures can be derived and a CYCLE-elimination theorem generalises CUT-elimination;(ii) as a logically-based session type system, which is more expressive than Caires and Pfenning's;(iii) as a logical foundation for Kobayashi's system, bringing it into the sphere of the propositionsas-types paradigm.
In this note, we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium logic, an extension of Answer Set programming for dealing with linear-time modal op...
详细信息
In this note, we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium logic, an extension of Answer Set programming for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of Temporal Equilibrium logic that shares the syntax of first-order Linear-time Temporal logic but has different semantics, selecting some Linear-time Temporal logic models we call temporal stable models. Then, we consider a subclass of theories (called splittable temporal logic programs) that are close to usual logic programs but allowing a restricted use of temporal operators. In this setting, we provide a syntactic definition of safe variables that suffices to show the property of domain independence - that is, addition of arbitrary elements in the universe does not vary the set of temporal stable models. Finally, we present a method for computing the derivable facts by constructing a non-temporal logic program with variables that is fed to a standard Answer Set programming grounder. The information provided by the grounder is then used to generate a subset of ground temporal rules which is equivalent to (and generally smaller than) the full program instantiation.
This paper explores the use of Answer Set programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) it shows how one can formulate DCO...
详细信息
This paper explores the use of Answer Set programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) it shows how one can formulate DCOPs as logic programs;(2) it introduces ASP-DPOP, the first DCOP algorithm that is based on logicprogramming;(3) it experimentally shows that ASP-DPOP can be up to two orders of magnitude faster than DPOP (its imperative programming counterpart) as well as solve some problems that DPOP fails to solve, due to memory limitations;and (4) it demonstrates the applicability of ASP in a wide array of multi-agent problems currently modeled as DCOPs.
The Lisp programming language is often described as the first functional programming language and also as an important early AI language. In the history of functional programming, however, it occupies a rather anomalo...
详细信息
The Lisp programming language is often described as the first functional programming language and also as an important early AI language. In the history of functional programming, however, it occupies a rather anomalous position, as the circumstances of its development do not fit well with the widely accepted view that functional languages have been developed through a theoretically-inspired project of deriving practical programming languages from the lambda calculus. This paper examines the origins of Lisp in the early AI programming work of the mid-to-late 1950s, and in particular in the work of Allen Newell, Cliff Shaw and Herbert Simon. Their 1956 program, the logictheory Machine, introduced new ideas about data and program structures that were articulated in response to perceived limitations in existing programming technique. Later writers, notably John Backus, have described these features as constituting a "programming language style" distinct from the traditional style that preceded it. The paper examines the origins of the earlier style in practices of manual computation, analyses the key technical differences between it and the style first manifested in the logictheory Machine, and concludes that programmingpractice and experience play a large and underappreciated role in the development of programming styles and languages.
Characterizations of semi-stable and stage extensions in terms of two-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models a...
详细信息
Characterizations of semi-stable and stage extensions in terms of two-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logicprogramming counterparts of the notion of range which is an established concept in argumentation semantics.
The links to the online only Technical Communications in Lamma and Swift (2013) are unfortunately broken. All of the Technical Communications can be found here: https://***/core/journals/theory-and-practice-of-logic-p...
The links to the online only Technical Communications in Lamma and Swift (2013) are unfortunately broken. All of the Technical Communications can be found here: https://***/core/journals/theory-and-practice-of-logic-programming/article/editorial-29th-international-conference-on-logic-programming-special-issue/82FDD81073DC30A563ED242516CADAAE#fndtn-supplementary-materials
We study cdcl-cuttingplanes, Open-WBO, and Sat4j, three successful solvers from the Pseudo-Boolean Competition 2016, and evaluate them by performing experiments on crafted benchmarks designed to be trivial for the cut...
详细信息
ISBN:
(纸本)9783319941448;9783319941431
We study cdcl-cuttingplanes, Open-WBO, and Sat4j, three successful solvers from the Pseudo-Boolean Competition 2016, and evaluate them by performing experiments on crafted benchmarks designed to be trivial for the cutting planes (CP) proof system underlying pseudo-Boolean (PB) proof search but yet potentially tricky for PB solvers. Our experiments demonstrate severe shortcomings in state-of-the-art PB solving techniques. Although our benchmarks have linear-size tree-like CP proofs, and are thus extremely easy in theory, the solvers often perform quite badly even for very small instances. We believe this shows that solvers need to employ stronger rules of cutting planes reasoning. Even some instances that lack not only Boolean but also real-valued solutions are very hard in practice, which indicates that PB solvers need to get better not only at Boolean reasoning but also at linear programming. Taken together, our results point to several crucial challenges to be overcome in the quest for more efficient pseudo-Boolean solvers, and we expect that a further study of our benchmarks could shed more light on the potential and limitations of current state-of-the-art PB solving.
Nurse and physician rostering problems seek to find an optimal way to assign nurses and physicians to shifts respecting a set of hard and soft constraints. If a single hard constraint is violated, the solution is cons...
详细信息
暂无评论