default search action
Jörg Würtz
Person information
- affiliation: Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [c16]Juergen Saalmueller, Jörg Würtz:
Embedded Controllers for Solving Complex Industry Applications. SoCC 2006: 149-152 - 2000
- [j5]Klaus Schild, Jörg Würtz:
Scheduling of Time-Triggered Real-Time Systems. Constraints An Int. J. 5(4): 335-357 (2000)
1990 – 1999
- 1999
- [j4]Tobias Müller, Jörg Würtz:
Embedding Propagators in a Concurrent Constraint Language. J. Funct. Log. Program. 1999(Special Issue 1) (1999) - 1998
- [b1]Jörg Würtz:
Lösen kombinatorischer Probleme mit Constraintprogrammierung in Oz. Saarland University, Saarbrücken, Germany, 1998, pp. 1-238 - [c15]Klaus Schild, Jörg Würtz:
Off-line scheduling of a real-time system. SAC 1998: 29-38 - 1997
- [c14]Tobias Müller, Jörg Würtz:
Connecting Propagators with a Concurrent Constraint Language. ICLP 1997: 412 - [c13]Tobias Müller, Jörg Würtz:
Extending a Concurrent Constraint Language by Propagators. ILPS 1997: 149-163 - 1996
- [j3]Philippe Devienne, Patrick Lebègue, Anne Parrain, Jean-Christophe Routier, Jörg Würtz:
Smallest Horn Clause Programs. J. Log. Program. 27(3): 227-267 (1996) - [c12]Jörg Würtz:
Oz Scheduler: A Workbench for Scheduling Problems. ICTAI 1996: 149-156 - [c11]Jörg Würtz, Tobias Müller:
Constructive Disjunction Revisited. KI 1996: 377-386 - 1995
- [c10]Martin Henz
, Jörg Würtz:
Using Oz for College Timetabling. PATAT 1995: 162-177 - [c9]Tobias Müller, Jörg Würtz:
Constructive Disjunction in Oz. WLP 1995: 113-122 - 1994
- [c8]Jörg Würtz:
Towards the Verification of Concurrent Constaint Programs in the Field of Finite Domain Reasoning. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994: 87-107 - [c7]Christian Schulte, Gert Smolka, Jörg Würtz:
Encapsulated Search and Constraint Programming in Oz. PPCP 1994: 134-150 - [c6]Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz:
One Binary Horn Clause is Enough. STACS 1994: 21-32 - 1993
- [j2]Philipp Hanschke, Jörg Würtz:
Satisfiability of the Smallest Binary Program. Inf. Process. Lett. 45(5): 237-241 (1993) - [c5]Martin Henz, Gert Smolka, Jörg Würtz:
Oz - A Programming Language for Multi-Agent Systems. IJCAI 1993: 404-409 - [c4]Gert Smolka, Martin Henz, Jörg Würtz:
Object-Oriented Concurrent Constraint Programming in Oz. KI 1993: 44-59 - [c3]Jörg Würtz:
Finite Domain Algorithms and their Verification in the Concurrent Constraint Language Oz. WLP 1993: 108-111 - 1992
- [j1]Jürgen Cleve, Steffen Hölldobler, Jörg Würtz:
7. Workshop Logische Programmierung und 8. Jahrestreffen der GI-Fachgruppe 1.2.1 "Deduktionssysteme". Künstliche Intell. 6(2): 46-47 (1992) - [c2]Wolfgang Bibel, Steffen Hölldobler, Jörg Würtz:
Cycle Unification. CADE 1992: 94-108 - [c1]Jörg Würtz:
Unifying Cycles. ECAI 1992: 60-64
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: