Refine
Has Fulltext
- no (165)
Year of publication
Document Type
- Article (165) (remove)
Language
- English (165) (remove)
Is part of the Bibliography
- yes (165)
Keywords
- answer set programming (7)
- Answer Set Programming (6)
- Answer set programming (6)
- Answer Set Programming (ASP) (2)
- Constraint Answer Set Programming (CASP) (2)
- Multi-objective optimization (2)
- Theory (2)
- bioinformatics (2)
- Aggregates (1)
- Algorithm configuration (1)
- Algorithm portfolios (1)
- Architecture synthesis (1)
- Automated parallelization (1)
- Boolean logic models (1)
- Boolean networks (1)
- Combinatorial multi-objective optimization (1)
- Complex optimization (1)
- Conformant Planning (1)
- Constraint Processing (CP) (1)
- Constraint Programming (CP) (1)
- Course timetabling (1)
- Educational timetabling (1)
- Epistemic Logic Programs (1)
- Incremental answer set programming (1)
- Knowledge representation (1)
- Localization (1)
- Logic programming (1)
- Meta-Programming (1)
- Minimal perturbation problems (1)
- Model identification (1)
- Multiplex phosphoproteomics data (1)
- Non-Monotonic (1)
- Nonmonotonic reasoning (1)
- Parallel SAT solving (1)
- Preference Handling (1)
- Programming by optimization (1)
- Reasoning (1)
- Reconfigurable architecture (1)
- Sat Modulo Theories (SMT) (1)
- Signaling transduction networks (1)
- System design (1)
- Systems biology (1)
- Technology mapping (1)
- Theory Solving (1)
- Time series data (1)
- Tracking (1)
- Wireless Sensor Networks (1)
- action and change (1)
- algorithm schedules (1)
- automated guided vehicle routing (1)
- automated planning (1)
- belief merging (1)
- belief revision (1)
- car assembly operations (1)
- consistency (1)
- course timetabling (1)
- declarative problem solving (1)
- diagnosis (1)
- educational timetabling (1)
- finite model computation (1)
- gap-filling (1)
- hybrid solving (1)
- knowledge representation and nonmonotonic reasoning (1)
- linear programming (1)
- metabolic network (1)
- planning (1)
- portfolio-based solving (1)
- program encodings (1)
- proof complexity (1)
- quantified logics (1)
- strong equivalence (1)
- tableau calculi (1)
- technical notes and rapid communications (1)
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.
Motivation: Continued development of analytical techniques based on gas chromatography and mass spectrometry now facilitates the generation of larger sets of metabolite concentration data. An important step towards the understanding of metabolite dynamics is the recognition of stable states where metabolite concentrations exhibit a simple behaviour. Such states can be characterized through the identification of significant thresholds in the concentrations. But general techniques for finding discretization thresholds in continuous data prove to be practically insufficient for detecting states due to the weak conditional dependences in concentration data. Results: We introduce a method of recognizing states in the framework of decision tree induction. It is based upon a global analysis of decision forests where stability and quality are evaluated. It leads to the detection of thresholds that are both comprehensible and robust. Applied to metabolite concentration data, this method has led to the discovery of hidden states in the corresponding variables. Some of these reflect known properties of the biological experiments, and others point to putative new states
The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.
The family of default logics
(1998)
In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of the ASP system clingo.
Under consideration for publication in Theory and Practice of Logic Programming (TPLP)